@vorionsys/platform-core 0.1.0

package/dist/proof/merkle-service.d.ts

@@ -0,0 +1,194 @@
+/**
+ * Merkle Service
+ *
+ * Manages Merkle tree aggregation of proofs, including:
+ * - Batching proofs by time window
+ * - Storing Merkle roots in database
+ * - Providing Merkle proofs for historical lookups
+ * - Scheduled aggregation jobs
+ *
+ * @packageDocumentation
+ */
+import { type MerkleRoot } from '../db/schema/merkle.js';
+import { type MerkleProof } from './merkle.js';
+import type { ID } from '../common/types.js';
+/**
+ * Configuration for MerkleService
+ */
+export interface MerkleServiceConfig {
+    /** Aggregation window in milliseconds (default: 1 hour) */
+    aggregationWindowMs?: number;
+    /** Minimum proofs required for aggregation (default: 1) */
+    minProofsForAggregation?: number;
+    /** Maximum proofs per tree (default: 10000) */
+    maxProofsPerTree?: number;
+}
+/**
+ * Result of adding a proof to the aggregation queue
+ */
+export interface QueueResult {
+    queued: boolean;
+    queueId: string;
+    proofId: string;
+}
+/**
+ * Result of an aggregation run
+ */
+export interface AggregationResult {
+    success: boolean;
+    rootId?: string;
+    rootHash?: string;
+    leafCount?: number;
+    error?: string;
+}
+/**
+ * Merkle root with additional metadata
+ */
+export interface MerkleRootInfo extends MerkleRoot {
+    /** Whether this root has been anchored to a blockchain */
+    anchored: boolean;
+}
+/**
+ * Full Merkle proof response with proof details
+ */
+export interface MerkleProofResponse {
+    found: boolean;
+    proofId: string;
+    merkleProof?: MerkleProof;
+    rootId?: string;
+    rootHash?: string;
+    anchorTx?: string | null;
+    anchorChain?: string | null;
+    anchoredAt?: string | null;
+    createdAt?: string;
+}
+/**
+ * Service for managing Merkle tree aggregation of proofs
+ */
+export declare class MerkleService {
+    private db;
+    private config;
+    private initialized;
+    private aggregationTimer;
+    constructor(config?: MerkleServiceConfig);
+    /**
+     * Initialize the service
+     */
+    initialize(): Promise<void>;
+    /**
+     * Ensure service is initialized
+     */
+    private ensureInitialized;
+    /**
+     * Queue a proof for Merkle aggregation
+     *
+     * @param proofId - The proof ID
+     * @param proofHash - The proof's hash
+     * @returns Queue result
+     */
+    queueProof(proofId: string, proofHash: string): Promise<QueueResult>;
+    /**
+     * Get pending proofs from the queue
+     *
+     * @param limit - Maximum number of proofs to fetch
+     * @param olderThan - Only fetch proofs older than this date
+     * @returns Array of pending proofs
+     */
+    getPendingProofs(limit?: number, olderThan?: Date): Promise<Array<{
+        id: string;
+        proofId: string;
+        proofHash: string;
+        queuedAt: Date;
+    }>>;
+    /**
+     * Aggregate pending proofs into a Merkle tree
+     *
+     * @returns Aggregation result
+     */
+    aggregatePendingProofs(): Promise<AggregationResult>;
+    /**
+     * Get Merkle proof for a specific proof
+     *
+     * @param proofId - The proof ID to get Merkle proof for
+     * @returns Merkle proof response
+     */
+    getMerkleProof(proofId: ID): Promise<MerkleProofResponse>;
+    /**
+     * Verify a Merkle proof for a specific proof
+     *
+     * @param proofId - The proof ID
+     * @param proofHash - The proof's hash
+     * @param expectedRoot - Optional expected root hash
+     * @returns True if the proof is valid and included in the tree
+     */
+    verifyMerkleProof(proofId: string, proofHash: string, expectedRoot?: string): Promise<{
+        valid: boolean;
+        error?: string;
+    }>;
+    /**
+     * Get list of recent Merkle roots
+     *
+     * @param limit - Maximum number of roots to return
+     * @param includeUnanchored - Whether to include unanchored roots
+     * @returns Array of Merkle root info
+     */
+    listRoots(limit?: number, includeUnanchored?: boolean): Promise<MerkleRootInfo[]>;
+    /**
+     * Get a specific Merkle root by ID
+     *
+     * @param rootId - The root ID
+     * @returns The Merkle root info or undefined
+     */
+    getRoot(rootId: string): Promise<MerkleRootInfo | undefined>;
+    /**
+     * Get a Merkle root by its hash
+     *
+     * @param rootHash - The root hash
+     * @returns The Merkle root info or undefined
+     */
+    getRootByHash(rootHash: string): Promise<MerkleRootInfo | undefined>;
+    /**
+     * Set anchor information for a Merkle root
+     *
+     * @param rootId - The root ID
+     * @param anchorTx - The anchor transaction hash
+     * @param anchorChain - The anchor chain (e.g., 'ethereum')
+     * @returns True if the anchor was set
+     */
+    setAnchor(rootId: string, anchorTx: string, anchorChain: string): Promise<boolean>;
+    /**
+     * Get unanchored roots for blockchain anchoring
+     *
+     * @param limit - Maximum number of roots to return
+     * @returns Array of unanchored Merkle roots
+     */
+    getUnanchoredRoots(limit?: number): Promise<MerkleRoot[]>;
+    /**
+     * Start the scheduled aggregation job
+     *
+     * @param intervalMs - Interval between aggregation runs (default: aggregation window)
+     */
+    startAggregationJob(intervalMs?: number): void;
+    /**
+     * Stop the scheduled aggregation job
+     */
+    stopAggregationJob(): void;
+    /**
+     * Get aggregation statistics
+     */
+    getStats(): Promise<{
+        totalRoots: number;
+        totalLeaves: number;
+        pendingProofs: number;
+        anchoredRoots: number;
+    }>;
+}
+/**
+ * Create a new MerkleService instance
+ */
+export declare function createMerkleService(config?: MerkleServiceConfig): MerkleService;
+/**
+ * Get the singleton MerkleService instance
+ */
+export declare function getMerkleService(): MerkleService;
+//# sourceMappingURL=merkle-service.d.ts.map

package/dist/proof/merkle-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merkle-service.d.ts","sourceRoot":"","sources":["../../src/proof/merkle-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EAIL,KAAK,UAAU,EAEhB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAKL,KAAK,WAAW,EAEjB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,oBAAoB,CAAC;AAmB7C;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,2DAA2D;IAC3D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,2DAA2D;IAC3D,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,+CAA+C;IAC/C,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,cAAe,SAAQ,UAAU;IAChD,0DAA0D;IAC1D,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,OAAO,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,EAAE,CAAyB;IACnC,OAAO,CAAC,MAAM,CAAgC;IAC9C,OAAO,CAAC,WAAW,CAAkB;IACrC,OAAO,CAAC,gBAAgB,CAA+B;gBAE3C,MAAM,GAAE,mBAAwB;IAQ5C;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAejC;;OAEG;YACW,iBAAiB;IAO/B;;;;;;OAMG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;IAqB1E;;;;;;OAMG;IACG,gBAAgB,CACpB,KAAK,GAAE,MAAqC,EAC5C,SAAS,CAAC,EAAE,IAAI,GACf,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;IAwBrF;;;;OAIG;IACG,sBAAsB,IAAI,OAAO,CAAC,iBAAiB,CAAC;IAqG1D;;;;;OAKG;IACG,cAAc,CAAC,OAAO,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,CAAC;IAiE/D;;;;;;;OAOG;IACG,iBAAiB,CACrB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,YAAY,CAAC,EAAE,MAAM,GACpB,OAAO,CAAC;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAoB9C;;;;;;OAMG;IACG,SAAS,CACb,KAAK,GAAE,MAAY,EACnB,iBAAiB,GAAE,OAAc,GAChC,OAAO,CAAC,cAAc,EAAE,CAAC;IA0B5B;;;;;OAKG;IACG,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,SAAS,CAAC;IAoBlE;;;;;OAKG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,SAAS,CAAC;IAoB1E;;;;;;;OAOG;IACG,SAAS,CACb,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,OAAO,CAAC;IAyBnB;;;;;OAKG;IACG,kBAAkB,CAAC,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAapE;;;;OAIG;IACH,mBAAmB,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI;IAmB9C;;OAEG;IACH,kBAAkB,IAAI,IAAI;IAQ1B;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC;QACxB,UAAU,EAAE,MAAM,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;CAiBH;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,CAAC,EAAE,mBAAmB,GAAG,aAAa,CAE/E;AAKD;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,aAAa,CAKhD"}

package/dist/proof/merkle-service.js

@@ -0,0 +1,463 @@
+/**
+ * Merkle Service
+ *
+ * Manages Merkle tree aggregation of proofs, including:
+ * - Batching proofs by time window
+ * - Storing Merkle roots in database
+ * - Providing Merkle proofs for historical lookups
+ * - Scheduled aggregation jobs
+ *
+ * @packageDocumentation
+ */
+import { eq, and, lte, desc, asc, isNull, isNotNull } from 'drizzle-orm';
+import { createLogger } from '../common/logger.js';
+import { getDatabase } from '../common/db.js';
+import { merkleRoots, merkleLeaves, merkleQueue, } from '../db/schema/merkle.js';
+import { buildMerkleTree, generateMerkleProof, verifyMerkleProof, hashProofToLeaf, } from './merkle.js';
+const logger = createLogger({ component: 'merkle-service' });
+/**
+ * Default aggregation window in milliseconds (1 hour)
+ */
+const DEFAULT_AGGREGATION_WINDOW_MS = 60 * 60 * 1000;
+/**
+ * Minimum number of proofs required for aggregation
+ */
+const MIN_PROOFS_FOR_AGGREGATION = 1;
+/**
+ * Maximum number of proofs per tree (to limit memory usage)
+ */
+const MAX_PROOFS_PER_TREE = 10000;
+/**
+ * Service for managing Merkle tree aggregation of proofs
+ */
+export class MerkleService {
+    db = null;
+    config;
+    initialized = false;
+    aggregationTimer = null;
+    constructor(config = {}) {
+        this.config = {
+            aggregationWindowMs: config.aggregationWindowMs ?? DEFAULT_AGGREGATION_WINDOW_MS,
+            minProofsForAggregation: config.minProofsForAggregation ?? MIN_PROOFS_FOR_AGGREGATION,
+            maxProofsPerTree: config.maxProofsPerTree ?? MAX_PROOFS_PER_TREE,
+        };
+    }
+    /**
+     * Initialize the service
+     */
+    async initialize() {
+        if (this.initialized)
+            return;
+        this.db = getDatabase();
+        this.initialized = true;
+        logger.info({
+            aggregationWindowMs: this.config.aggregationWindowMs,
+            minProofsForAggregation: this.config.minProofsForAggregation,
+        }, 'MerkleService initialized');
+    }
+    /**
+     * Ensure service is initialized
+     */
+    async ensureInitialized() {
+        if (!this.initialized || !this.db) {
+            await this.initialize();
+        }
+        return this.db;
+    }
+    /**
+     * Queue a proof for Merkle aggregation
+     *
+     * @param proofId - The proof ID
+     * @param proofHash - The proof's hash
+     * @returns Queue result
+     */
+    async queueProof(proofId, proofHash) {
+        const db = await this.ensureInitialized();
+        const queueId = crypto.randomUUID();
+        await db.insert(merkleQueue).values({
+            id: queueId,
+            proofId,
+            proofHash,
+            aggregated: false,
+        });
+        logger.debug({ proofId, queueId }, 'Proof queued for Merkle aggregation');
+        return {
+            queued: true,
+            queueId,
+            proofId,
+        };
+    }
+    /**
+     * Get pending proofs from the queue
+     *
+     * @param limit - Maximum number of proofs to fetch
+     * @param olderThan - Only fetch proofs older than this date
+     * @returns Array of pending proofs
+     */
+    async getPendingProofs(limit = this.config.maxProofsPerTree, olderThan) {
+        const db = await this.ensureInitialized();
+        const conditions = [eq(merkleQueue.aggregated, false)];
+        if (olderThan) {
+            conditions.push(lte(merkleQueue.queuedAt, olderThan));
+        }
+        const results = await db
+            .select({
+            id: merkleQueue.id,
+            proofId: merkleQueue.proofId,
+            proofHash: merkleQueue.proofHash,
+            queuedAt: merkleQueue.queuedAt,
+        })
+            .from(merkleQueue)
+            .where(and(...conditions))
+            .orderBy(asc(merkleQueue.queuedAt))
+            .limit(limit);
+        return results;
+    }
+    /**
+     * Aggregate pending proofs into a Merkle tree
+     *
+     * @returns Aggregation result
+     */
+    async aggregatePendingProofs() {
+        const db = await this.ensureInitialized();
+        // Calculate the cutoff time for the aggregation window
+        const windowEnd = new Date();
+        const windowStart = new Date(windowEnd.getTime() - this.config.aggregationWindowMs);
+        // Get pending proofs within the time window
+        const pendingProofs = await this.getPendingProofs(this.config.maxProofsPerTree, windowEnd);
+        if (pendingProofs.length < this.config.minProofsForAggregation) {
+            logger.debug({ pendingCount: pendingProofs.length, required: this.config.minProofsForAggregation }, 'Not enough pending proofs for aggregation');
+            return { success: false, error: 'Not enough pending proofs' };
+        }
+        try {
+            // Build the Merkle tree
+            const proofData = pendingProofs.map((p) => ({
+                id: p.proofId,
+                hash: p.proofHash,
+            }));
+            const tree = await buildMerkleTree(await Promise.all(proofData.map((p) => hashProofToLeaf(p.id, p.hash))));
+            // Generate proofs for all leaves
+            const leafProofs = [];
+            for (let i = 0; i < pendingProofs.length; i++) {
+                leafProofs.push(generateMerkleProof(i, tree));
+            }
+            // Store the Merkle root
+            const rootId = crypto.randomUUID();
+            await db.insert(merkleRoots).values({
+                id: rootId,
+                rootHash: tree.root,
+                leafCount: tree.leafCount,
+                windowStart,
+                windowEnd,
+                treeLevels: tree.levels,
+            });
+            // Store leaf records and update queue
+            const now = new Date();
+            for (let i = 0; i < pendingProofs.length; i++) {
+                const pending = pendingProofs[i];
+                const proof = leafProofs[i];
+                // Insert leaf record
+                await db.insert(merkleLeaves).values({
+                    proofId: pending.proofId,
+                    rootId,
+                    leafIndex: proof.leafIndex,
+                    leafHash: proof.leafHash,
+                    siblingHashes: proof.siblingHashes,
+                    siblingDirections: proof.siblingDirections,
+                });
+                // Update queue item as aggregated
+                await db
+                    .update(merkleQueue)
+                    .set({
+                    aggregated: true,
+                    rootId,
+                    aggregatedAt: now,
+                })
+                    .where(eq(merkleQueue.id, pending.id));
+            }
+            logger.info({
+                rootId,
+                rootHash: tree.root.slice(0, 16) + '...',
+                leafCount: tree.leafCount,
+                windowStart: windowStart.toISOString(),
+                windowEnd: windowEnd.toISOString(),
+            }, 'Merkle aggregation completed');
+            return {
+                success: true,
+                rootId,
+                rootHash: tree.root,
+                leafCount: tree.leafCount,
+            };
+        }
+        catch (error) {
+            const errorMessage = error instanceof Error ? error.message : 'Unknown error';
+            logger.error({ error }, 'Merkle aggregation failed');
+            return { success: false, error: errorMessage };
+        }
+    }
+    /**
+     * Get Merkle proof for a specific proof
+     *
+     * @param proofId - The proof ID to get Merkle proof for
+     * @returns Merkle proof response
+     */
+    async getMerkleProof(proofId) {
+        const db = await this.ensureInitialized();
+        // Find the leaf record
+        const leafResult = await db
+            .select()
+            .from(merkleLeaves)
+            .where(eq(merkleLeaves.proofId, proofId))
+            .limit(1);
+        if (leafResult.length === 0) {
+            // Check if proof is pending
+            const pendingResult = await db
+                .select()
+                .from(merkleQueue)
+                .where(and(eq(merkleQueue.proofId, proofId), eq(merkleQueue.aggregated, false)))
+                .limit(1);
+            if (pendingResult.length > 0) {
+                logger.debug({ proofId }, 'Proof is pending Merkle aggregation');
+                return { found: false, proofId };
+            }
+            return { found: false, proofId };
+        }
+        const leaf = leafResult[0];
+        // Get the root record
+        const rootResult = await db
+            .select()
+            .from(merkleRoots)
+            .where(eq(merkleRoots.id, leaf.rootId))
+            .limit(1);
+        if (rootResult.length === 0) {
+            logger.warn({ proofId, rootId: leaf.rootId }, 'Merkle root not found for leaf');
+            return { found: false, proofId };
+        }
+        const root = rootResult[0];
+        // Reconstruct the Merkle proof
+        const merkleProof = {
+            leafIndex: leaf.leafIndex,
+            leafHash: leaf.leafHash,
+            siblingHashes: leaf.siblingHashes,
+            siblingDirections: leaf.siblingDirections,
+            root: root.rootHash,
+            leafCount: root.leafCount,
+        };
+        return {
+            found: true,
+            proofId,
+            merkleProof,
+            rootId: root.id,
+            rootHash: root.rootHash,
+            anchorTx: root.anchorTx,
+            anchorChain: root.anchorChain,
+            anchoredAt: root.anchoredAt?.toISOString() ?? null,
+            createdAt: root.createdAt.toISOString(),
+        };
+    }
+    /**
+     * Verify a Merkle proof for a specific proof
+     *
+     * @param proofId - The proof ID
+     * @param proofHash - The proof's hash
+     * @param expectedRoot - Optional expected root hash
+     * @returns True if the proof is valid and included in the tree
+     */
+    async verifyMerkleProof(proofId, proofHash, expectedRoot) {
+        const proofResponse = await this.getMerkleProof(proofId);
+        if (!proofResponse.found || !proofResponse.merkleProof) {
+            return { valid: false, error: 'Merkle proof not found' };
+        }
+        // Verify the leaf hash matches
+        const expectedLeafHash = await hashProofToLeaf(proofId, proofHash);
+        if (proofResponse.merkleProof.leafHash !== expectedLeafHash) {
+            return { valid: false, error: 'Leaf hash mismatch' };
+        }
+        // Verify the Merkle proof
+        const targetRoot = expectedRoot ?? proofResponse.merkleProof.root;
+        const valid = await verifyMerkleProof(proofResponse.merkleProof, targetRoot);
+        return { valid };
+    }
+    /**
+     * Get list of recent Merkle roots
+     *
+     * @param limit - Maximum number of roots to return
+     * @param includeUnanchored - Whether to include unanchored roots
+     * @returns Array of Merkle root info
+     */
+    async listRoots(limit = 100, includeUnanchored = true) {
+        const db = await this.ensureInitialized();
+        let results;
+        if (includeUnanchored) {
+            results = await db
+                .select()
+                .from(merkleRoots)
+                .orderBy(desc(merkleRoots.createdAt))
+                .limit(limit);
+        }
+        else {
+            results = await db
+                .select()
+                .from(merkleRoots)
+                .where(isNotNull(merkleRoots.anchorTx))
+                .orderBy(desc(merkleRoots.createdAt))
+                .limit(limit);
+        }
+        return results.map((root) => ({
+            ...root,
+            anchored: root.anchorTx !== null,
+        }));
+    }
+    /**
+     * Get a specific Merkle root by ID
+     *
+     * @param rootId - The root ID
+     * @returns The Merkle root info or undefined
+     */
+    async getRoot(rootId) {
+        const db = await this.ensureInitialized();
+        const result = await db
+            .select()
+            .from(merkleRoots)
+            .where(eq(merkleRoots.id, rootId))
+            .limit(1);
+        if (result.length === 0) {
+            return undefined;
+        }
+        const root = result[0];
+        return {
+            ...root,
+            anchored: root.anchorTx !== null,
+        };
+    }
+    /**
+     * Get a Merkle root by its hash
+     *
+     * @param rootHash - The root hash
+     * @returns The Merkle root info or undefined
+     */
+    async getRootByHash(rootHash) {
+        const db = await this.ensureInitialized();
+        const result = await db
+            .select()
+            .from(merkleRoots)
+            .where(eq(merkleRoots.rootHash, rootHash))
+            .limit(1);
+        if (result.length === 0) {
+            return undefined;
+        }
+        const root = result[0];
+        return {
+            ...root,
+            anchored: root.anchorTx !== null,
+        };
+    }
+    /**
+     * Set anchor information for a Merkle root
+     *
+     * @param rootId - The root ID
+     * @param anchorTx - The anchor transaction hash
+     * @param anchorChain - The anchor chain (e.g., 'ethereum')
+     * @returns True if the anchor was set
+     */
+    async setAnchor(rootId, anchorTx, anchorChain) {
+        const db = await this.ensureInitialized();
+        const result = await db
+            .update(merkleRoots)
+            .set({
+            anchorTx,
+            anchorChain,
+            anchoredAt: new Date(),
+        })
+            .where(eq(merkleRoots.id, rootId))
+            .returning({ id: merkleRoots.id });
+        if (result.length === 0) {
+            return false;
+        }
+        logger.info({ rootId, anchorTx, anchorChain }, 'Merkle root anchored to blockchain');
+        return true;
+    }
+    /**
+     * Get unanchored roots for blockchain anchoring
+     *
+     * @param limit - Maximum number of roots to return
+     * @returns Array of unanchored Merkle roots
+     */
+    async getUnanchoredRoots(limit = 100) {
+        const db = await this.ensureInitialized();
+        const results = await db
+            .select()
+            .from(merkleRoots)
+            .where(isNull(merkleRoots.anchorTx))
+            .orderBy(asc(merkleRoots.createdAt))
+            .limit(limit);
+        return results;
+    }
+    /**
+     * Start the scheduled aggregation job
+     *
+     * @param intervalMs - Interval between aggregation runs (default: aggregation window)
+     */
+    startAggregationJob(intervalMs) {
+        if (this.aggregationTimer) {
+            logger.warn('Aggregation job already running');
+            return;
+        }
+        const interval = intervalMs ?? this.config.aggregationWindowMs;
+        this.aggregationTimer = setInterval(async () => {
+            try {
+                await this.aggregatePendingProofs();
+            }
+            catch (error) {
+                logger.error({ error }, 'Scheduled aggregation failed');
+            }
+        }, interval);
+        logger.info({ intervalMs: interval }, 'Merkle aggregation job started');
+    }
+    /**
+     * Stop the scheduled aggregation job
+     */
+    stopAggregationJob() {
+        if (this.aggregationTimer) {
+            clearInterval(this.aggregationTimer);
+            this.aggregationTimer = null;
+            logger.info('Merkle aggregation job stopped');
+        }
+    }
+    /**
+     * Get aggregation statistics
+     */
+    async getStats() {
+        const db = await this.ensureInitialized();
+        const [rootsResult, leavesResult, pendingResult, anchoredResult] = await Promise.all([
+            db.select().from(merkleRoots),
+            db.select().from(merkleLeaves),
+            db.select().from(merkleQueue).where(eq(merkleQueue.aggregated, false)),
+            db.select().from(merkleRoots).where(isNotNull(merkleRoots.anchorTx)),
+        ]);
+        return {
+            totalRoots: rootsResult.length,
+            totalLeaves: leavesResult.length,
+            pendingProofs: pendingResult.length,
+            anchoredRoots: anchoredResult.length,
+        };
+    }
+}
+/**
+ * Create a new MerkleService instance
+ */
+export function createMerkleService(config) {
+    return new MerkleService(config);
+}
+// Singleton instance for convenience
+let merkleServiceInstance = null;
+/**
+ * Get the singleton MerkleService instance
+ */
+export function getMerkleService() {
+    if (!merkleServiceInstance) {
+        merkleServiceInstance = new MerkleService();
+    }
+    return merkleServiceInstance;
+}
+//# sourceMappingURL=merkle-service.js.map

package/dist/proof/merkle-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merkle-service.js","sourceRoot":"","sources":["../../src/proof/merkle-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAiB,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EACL,WAAW,EACX,YAAY,EACZ,WAAW,GAGZ,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EACjB,eAAe,GAGhB,MAAM,aAAa,CAAC;AAGrB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAAC;AAE7D;;GAEG;AACH,MAAM,6BAA6B,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAErD;;GAEG;AACH,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAErC;;GAEG;AACH,MAAM,mBAAmB,GAAG,KAAK,CAAC;AAyDlC;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,EAAE,GAAoB,IAAI,CAAC;IAC3B,MAAM,CAAgC;IACtC,WAAW,GAAY,KAAK,CAAC;IAC7B,gBAAgB,GAA0B,IAAI,CAAC;IAEvD,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG;YACZ,mBAAmB,EAAE,MAAM,CAAC,mBAAmB,IAAI,6BAA6B;YAChF,uBAAuB,EAAE,MAAM,CAAC,uBAAuB,IAAI,0BAA0B;YACrF,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,IAAI,mBAAmB;SACjE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC,EAAE,GAAG,WAAW,EAAE,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAExB,MAAM,CAAC,IAAI,CACT;YACE,mBAAmB,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB;YACpD,uBAAuB,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB;SAC7D,EACD,2BAA2B,CAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB;QAC7B,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC,EAAG,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,UAAU,CAAC,OAAe,EAAE,SAAiB;QACjD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QAEpC,MAAM,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;YAClC,EAAE,EAAE,OAAO;YACX,OAAO;YACP,SAAS;YACT,UAAU,EAAE,KAAK;SAClB,CAAC,CAAC;QAEH,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,qCAAqC,CAAC,CAAC;QAE1E,OAAO;YACL,MAAM,EAAE,IAAI;YACZ,OAAO;YACP,OAAO;SACR,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,gBAAgB,CACpB,QAAgB,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAC5C,SAAgB;QAEhB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,UAAU,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;QAEvD,IAAI,SAAS,EAAE,CAAC;YACd,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,EAAE;aACrB,MAAM,CAAC;YACN,EAAE,EAAE,WAAW,CAAC,EAAE;YAClB,OAAO,EAAE,WAAW,CAAC,OAAO;YAC5B,SAAS,EAAE,WAAW,CAAC,SAAS;YAChC,QAAQ,EAAE,WAAW,CAAC,QAAQ;SAC/B,CAAC;aACD,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;aACzB,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;aAClC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEhB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,sBAAsB;QAC1B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,uDAAuD;QACvD,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAEpF,4CAA4C;QAC5C,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAC/C,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAC5B,SAAS,CACV,CAAC;QAEF,IAAI,aAAa,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,uBAAuB,EAAE,CAAC;YAC/D,MAAM,CAAC,KAAK,CACV,EAAE,YAAY,EAAE,aAAa,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB,EAAE,EACrF,2CAA2C,CAC5C,CAAC;YACF,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,2BAA2B,EAAE,CAAC;QAChE,CAAC;QAED,IAAI,CAAC;YACH,wBAAwB;YACxB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1C,EAAE,EAAE,CAAC,CAAC,OAAO;gBACb,IAAI,EAAE,CAAC,CAAC,SAAS;aAClB,CAAC,CAAC,CAAC;YAEJ,MAAM,IAAI,GAAG,MAAM,eAAe,CAChC,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACvE,CAAC;YAEF,iCAAiC;YACjC,MAAM,UAAU,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,UAAU,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,wBAAwB;YACxB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;YAEnC,MAAM,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;gBAClC,EAAE,EAAE,MAAM;gBACV,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,WAAW;gBACX,SAAS;gBACT,UAAU,EAAE,IAAI,CAAC,MAAM;aACxB,CAAC,CAAC;YAEH,sCAAsC;YACtC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC;gBAClC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;gBAE7B,qBAAqB;gBACrB,MAAM,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC;oBACnC,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,MAAM;oBACN,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,aAAa,EAAE,KAAK,CAAC,aAAa;oBAClC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;iBAC3C,CAAC,CAAC;gBAEH,kCAAkC;gBAClC,MAAM,EAAE;qBACL,MAAM,CAAC,WAAW,CAAC;qBACnB,GAAG,CAAC;oBACH,UAAU,EAAE,IAAI;oBAChB,MAAM;oBACN,YAAY,EAAE,GAAG;iBAClB,CAAC;qBACD,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,CAAC;YAED,MAAM,CAAC,IAAI,CACT;gBACE,MAAM;gBACN,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK;gBACxC,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE;gBACtC,SAAS,EAAE,SAAS,CAAC,WAAW,EAAE;aACnC,EACD,8BAA8B,CAC/B,CAAC;YAEF,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM;gBACN,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,SAAS,EAAE,IAAI,CAAC,SAAS;aAC1B,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC;YAC9E,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,2BAA2B,CAAC,CAAC;YACrD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;QACjD,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc,CAAC,OAAW;QAC9B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,uBAAuB;QACvB,MAAM,UAAU,GAAG,MAAM,EAAE;aACxB,MAAM,EAAE;aACR,IAAI,CAAC,YAAY,CAAC;aAClB,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;aACxC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,4BAA4B;YAC5B,MAAM,aAAa,GAAG,MAAM,EAAE;iBAC3B,MAAM,EAAE;iBACR,IAAI,CAAC,WAAW,CAAC;iBACjB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;iBAC/E,KAAK,CAAC,CAAC,CAAC,CAAC;YAEZ,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,qCAAqC,CAAC,CAAC;gBACjE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;YACnC,CAAC;YAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACnC,CAAC;QAED,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;QAE5B,sBAAsB;QACtB,MAAM,UAAU,GAAG,MAAM,EAAE;aACxB,MAAM,EAAE;aACR,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aACtC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,gCAAgC,CAAC,CAAC;YAChF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACnC,CAAC;QAED,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;QAE5B,+BAA+B;QAC/B,MAAM,WAAW,GAAgB;YAC/B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;QAEF,OAAO;YACL,KAAK,EAAE,IAAI;YACX,OAAO;YACP,WAAW;YACX,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,WAAW,EAAE,IAAI,IAAI;YAClD,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE;SACxC,CAAC;IACJ,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,iBAAiB,CACrB,OAAe,EACf,SAAiB,EACjB,YAAqB;QAErB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAEzD,IAAI,CAAC,aAAa,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC;YACvD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,wBAAwB,EAAE,CAAC;QAC3D,CAAC;QAED,+BAA+B;QAC/B,MAAM,gBAAgB,GAAG,MAAM,eAAe,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACnE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YAC5D,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC;QACvD,CAAC;QAED,0BAA0B;QAC1B,MAAM,UAAU,GAAG,YAAY,IAAI,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC;QAClE,MAAM,KAAK,GAAG,MAAM,iBAAiB,CAAC,aAAa,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QAE7E,OAAO,EAAE,KAAK,EAAE,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAS,CACb,QAAgB,GAAG,EACnB,oBAA6B,IAAI;QAEjC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,IAAI,OAAO,CAAC;QAEZ,IAAI,iBAAiB,EAAE,CAAC;YACtB,OAAO,GAAG,MAAM,EAAE;iBACf,MAAM,EAAE;iBACR,IAAI,CAAC,WAAW,CAAC;iBACjB,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;iBACpC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,MAAM,EAAE;iBACf,MAAM,EAAE;iBACR,IAAI,CAAC,WAAW,CAAC;iBACjB,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;iBACtC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;iBACpC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClB,CAAC;QAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC5B,GAAG,IAAI;YACP,QAAQ,EAAE,IAAI,CAAC,QAAQ,KAAK,IAAI;SACjC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CAAC,MAAc;QAC1B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,MAAM,GAAG,MAAM,EAAE;aACpB,MAAM,EAAE;aACR,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;aACjC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACxB,OAAO;YACL,GAAG,IAAI;YACP,QAAQ,EAAE,IAAI,CAAC,QAAQ,KAAK,IAAI;SACjC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,aAAa,CAAC,QAAgB;QAClC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,MAAM,GAAG,MAAM,EAAE;aACpB,MAAM,EAAE;aACR,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;aACzC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACxB,OAAO;YACL,GAAG,IAAI;YACP,QAAQ,EAAE,IAAI,CAAC,QAAQ,KAAK,IAAI;SACjC,CAAC;IACJ,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,SAAS,CACb,MAAc,EACd,QAAgB,EAChB,WAAmB;QAEnB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,MAAM,GAAG,MAAM,EAAE;aACpB,MAAM,CAAC,WAAW,CAAC;aACnB,GAAG,CAAC;YACH,QAAQ;YACR,WAAW;YACX,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;aACD,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;aACjC,SAAS,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC;QAErC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,CAAC,IAAI,CACT,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,EACjC,oCAAoC,CACrC,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,kBAAkB,CAAC,QAAgB,GAAG;QAC1C,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,OAAO,GAAG,MAAM,EAAE;aACrB,MAAM,EAAE;aACR,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;aACnC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;aACnC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEhB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,mBAAmB,CAAC,UAAmB;QACrC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;YAC/C,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC;QAE/D,IAAI,CAAC,gBAAgB,GAAG,WAAW,CAAC,KAAK,IAAI,EAAE;YAC7C,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACtC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,8BAA8B,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,EAAE,QAAQ,CAAC,CAAC;QAEb,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,gCAAgC,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,aAAa,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACrC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QAMZ,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,MAAM,CAAC,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACnF,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC;YAC7B,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC;YAC9B,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACtE,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;SACrE,CAAC,CAAC;QAEH,OAAO;YACL,UAAU,EAAE,WAAW,CAAC,MAAM;YAC9B,WAAW,EAAE,YAAY,CAAC,MAAM;YAChC,aAAa,EAAE,aAAa,CAAC,MAAM;YACnC,aAAa,EAAE,cAAc,CAAC,MAAM;SACrC,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAA4B;IAC9D,OAAO,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,qCAAqC;AACrC,IAAI,qBAAqB,GAAyB,IAAI,CAAC;AAEvD;;GAEG;AACH,MAAM,UAAU,gBAAgB;IAC9B,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC3B,qBAAqB,GAAG,IAAI,aAAa,EAAE,CAAC;IAC9C,CAAC;IACD,OAAO,qBAAqB,CAAC;AAC/B,CAAC"}