@vorionsys/atsf-core 0.2.0 → 0.2.2

package/dist/proof/zk-proofs.js

@@ -0,0 +1,531 @@
+/**
+ * Zero-Knowledge Proof Service for Privacy-Preserving Trust Verification
+ *
+ * Implements ZK proofs to enable:
+ * - Trust tier verification without revealing exact score
+ * - Action authorization without exposing full context
+ * - Compliance attestation without disclosing sensitive data
+ *
+ * Proof Types:
+ * - Range proofs (score in tier range)
+ * - Membership proofs (role in allowed set)
+ * - Threshold proofs (score >= minimum)
+ *
+ * Implementation uses Bulletproofs-style commitments for range proofs.
+ * For production deployment, integrate with full ZK library (snarkjs, circom).
+ *
+ * @packageDocumentation
+ */
+import * as nodeCrypto from 'node:crypto';
+import { createLogger } from '../common/logger.js';
+const logger = createLogger({ component: 'proof:zk' });
+/**
+ * Trust tier boundaries
+ */
+const TIER_BOUNDARIES = {
+    T0: [0, 99],
+    T1: [100, 299],
+    T2: [300, 499],
+    T3: [500, 699],
+    T4: [700, 899],
+    T5: [900, 1000],
+};
+// =============================================================================
+// CRYPTOGRAPHIC PRIMITIVES
+// =============================================================================
+/**
+ * Generate random 256-bit scalar
+ */
+function randomScalar() {
+    return nodeCrypto.randomBytes(32).toString('hex');
+}
+/**
+ * SHA-256 hash
+ */
+function hash(...inputs) {
+    const hasher = nodeCrypto.createHash('sha256');
+    for (const input of inputs) {
+        hasher.update(input);
+    }
+    return hasher.digest('hex');
+}
+/**
+ * Create Pedersen commitment
+ *
+ * In a real implementation, this would use elliptic curve operations.
+ * This is a simplified hash-based commitment for demonstration.
+ */
+export function createCommitment(value) {
+    const blinding = randomScalar();
+    // C = H(value || blinding)
+    // In real Pedersen: C = value*G + blinding*H
+    const commitment = hash(value.toString(), blinding);
+    return { commitment, blinding };
+}
+/**
+ * Verify a commitment matches a value
+ */
+export function verifyCommitment(commitment, value, blinding) {
+    const expected = hash(value.toString(), blinding);
+    return commitment === expected;
+}
+// =============================================================================
+// RANGE PROOFS
+// =============================================================================
+/**
+ * Generate a simplified range proof
+ *
+ * Uses a commit-and-prove approach where:
+ * 1. Commit to the value
+ * 2. Prove value is in range using bit decomposition
+ *
+ * For production, use Bulletproofs library.
+ */
+export function generateRangeProof(value, min, max) {
+    // Validate range
+    if (value < min || value > max) {
+        logger.warn({ value, min, max }, 'Value out of range');
+        return null;
+    }
+    // Create commitment
+    const commitment = createCommitment(value);
+    // Generate proof data
+    // In real Bulletproofs, this would be a complex proof of bit decomposition
+    // This simplified version proves knowledge of value in range
+    const rangeSize = max - min;
+    const normalizedValue = value - min;
+    // Bit decomposition of normalized value
+    const numBits = Math.ceil(Math.log2(rangeSize + 1));
+    const bits = [];
+    let temp = normalizedValue;
+    for (let i = 0; i < numBits; i++) {
+        bits.push(temp & 1);
+        temp >>= 1;
+    }
+    // Create bit commitments
+    const bitCommitments = [];
+    const bitBlindings = [];
+    for (let i = 0; i < numBits; i++) {
+        const bitCommitment = createCommitment(bits[i]);
+        bitCommitments.push(bitCommitment.commitment);
+        bitBlindings.push(bitCommitment.blinding);
+    }
+    // Challenge (Fiat-Shamir)
+    const challenge = hash(commitment.commitment, min.toString(), max.toString(), ...bitCommitments);
+    // Response
+    const response = hash(challenge, commitment.blinding, ...bitBlindings);
+    const proofData = JSON.stringify({
+        bitCommitments,
+        challenge,
+        response,
+    });
+    const proof = {
+        proofId: nodeCrypto.randomUUID(),
+        proofType: 'range',
+        commitment: commitment.commitment,
+        rangeMin: min,
+        rangeMax: max,
+        proof: Buffer.from(proofData).toString('base64'),
+        createdAt: new Date(),
+    };
+    return { proof, secret: commitment };
+}
+/**
+ * Verify a range proof
+ *
+ * Verifies that the committed value is in [rangeMin, rangeMax]
+ */
+export function verifyRangeProof(proof) {
+    try {
+        const proofData = JSON.parse(Buffer.from(proof.proof, 'base64').toString());
+        // Recompute challenge
+        const expectedChallenge = hash(proof.commitment, proof.rangeMin.toString(), proof.rangeMax.toString(), ...proofData.bitCommitments);
+        if (proofData.challenge !== expectedChallenge) {
+            return {
+                valid: false,
+                proofId: proof.proofId,
+                verifiedAt: new Date(),
+                reason: 'Challenge mismatch',
+            };
+        }
+        // In a real implementation, we would verify:
+        // 1. Each bit commitment is a valid 0 or 1
+        // 2. Sum of bits equals the committed value
+        // 3. All responses are valid
+        return {
+            valid: true,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+        };
+    }
+    catch (error) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: `Proof parsing failed: ${error instanceof Error ? error.message : 'Unknown'}`,
+        };
+    }
+}
+// =============================================================================
+// THRESHOLD PROOFS
+// =============================================================================
+/**
+ * Generate a threshold proof (value >= threshold)
+ */
+export function generateThresholdProof(value, threshold) {
+    if (value < threshold) {
+        logger.warn({ value, threshold }, 'Value below threshold');
+        return null;
+    }
+    const commitment = createCommitment(value);
+    // Prove value - threshold >= 0 using range proof
+    const difference = value - threshold;
+    const diffCommitment = createCommitment(difference);
+    const challenge = hash(commitment.commitment, threshold.toString(), diffCommitment.commitment);
+    const response = hash(challenge, commitment.blinding, diffCommitment.blinding);
+    const proofData = JSON.stringify({
+        differenceCommitment: diffCommitment.commitment,
+        challenge,
+        response,
+    });
+    const proof = {
+        proofId: nodeCrypto.randomUUID(),
+        proofType: 'threshold',
+        commitment: commitment.commitment,
+        threshold,
+        proof: Buffer.from(proofData).toString('base64'),
+        createdAt: new Date(),
+    };
+    return { proof, secret: commitment };
+}
+/**
+ * Verify a threshold proof
+ */
+export function verifyThresholdProof(proof) {
+    try {
+        const proofData = JSON.parse(Buffer.from(proof.proof, 'base64').toString());
+        const expectedChallenge = hash(proof.commitment, proof.threshold.toString(), proofData.differenceCommitment);
+        if (proofData.challenge !== expectedChallenge) {
+            return {
+                valid: false,
+                proofId: proof.proofId,
+                verifiedAt: new Date(),
+                reason: 'Challenge mismatch',
+            };
+        }
+        return {
+            valid: true,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+        };
+    }
+    catch (error) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: `Proof parsing failed: ${error instanceof Error ? error.message : 'Unknown'}`,
+        };
+    }
+}
+// =============================================================================
+// MEMBERSHIP PROOFS
+// =============================================================================
+/**
+ * Generate a membership proof (value in set)
+ *
+ * Proves that committed value is in the allowed set without revealing which one.
+ * Uses ring signature-style construction.
+ */
+export function generateMembershipProof(value, allowedSet) {
+    const valueIndex = allowedSet.indexOf(value);
+    if (valueIndex === -1) {
+        logger.warn({ value }, 'Value not in allowed set');
+        return null;
+    }
+    // Hash the allowed set
+    const setHash = hash(...allowedSet.sort());
+    // Create commitment to value
+    const valueHash = hash(value);
+    const blinding = randomScalar();
+    const commitment = hash(valueHash, blinding);
+    // Ring signature style proof
+    // For each element, create a challenge/response pair
+    const responses = [];
+    for (let i = 0; i < allowedSet.length; i++) {
+        if (i === valueIndex) {
+            // Real response for our value
+            responses.push(hash(blinding, i.toString()));
+        }
+        else {
+            // Simulated response for other values
+            responses.push(randomScalar());
+        }
+    }
+    const challenge = hash(commitment, setHash, ...responses);
+    const finalResponse = hash(challenge, blinding);
+    const proofData = JSON.stringify({
+        responses,
+        challenge,
+        finalResponse,
+    });
+    const proof = {
+        proofId: nodeCrypto.randomUUID(),
+        proofType: 'membership',
+        commitment,
+        setHash,
+        proof: Buffer.from(proofData).toString('base64'),
+        createdAt: new Date(),
+    };
+    return { proof, secret: blinding };
+}
+/**
+ * Verify a membership proof
+ */
+export function verifyMembershipProof(proof, allowedSet) {
+    try {
+        // Verify set hash
+        const expectedSetHash = hash(...allowedSet.sort());
+        if (proof.setHash !== expectedSetHash) {
+            return {
+                valid: false,
+                proofId: proof.proofId,
+                verifiedAt: new Date(),
+                reason: 'Set hash mismatch',
+            };
+        }
+        const proofData = JSON.parse(Buffer.from(proof.proof, 'base64').toString());
+        // Verify challenge
+        const expectedChallenge = hash(proof.commitment, proof.setHash, ...proofData.responses);
+        if (proofData.challenge !== expectedChallenge) {
+            return {
+                valid: false,
+                proofId: proof.proofId,
+                verifiedAt: new Date(),
+                reason: 'Challenge mismatch',
+            };
+        }
+        return {
+            valid: true,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+        };
+    }
+    catch (error) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: `Proof parsing failed: ${error instanceof Error ? error.message : 'Unknown'}`,
+        };
+    }
+}
+// =============================================================================
+// TRUST TIER PROOFS
+// =============================================================================
+/**
+ * Generate a trust tier proof
+ *
+ * Proves agent is in a specific tier without revealing exact score.
+ */
+export function generateTrustTierProof(agentId, score, tier, validityDurationMs = 3600000 // 1 hour
+) {
+    const tierRange = TIER_BOUNDARIES[tier];
+    if (!tierRange) {
+        logger.warn({ tier }, 'Invalid tier');
+        return null;
+    }
+    const [min, max] = tierRange;
+    // Verify score is in tier
+    if (score < min || score > max) {
+        logger.warn({ score, tier, min, max }, 'Score not in tier range');
+        return null;
+    }
+    // Generate range proof
+    const rangeResult = generateRangeProof(score, min, max);
+    if (!rangeResult) {
+        return null;
+    }
+    // Create tier commitment
+    const tierCommitment = hash(agentId, tier, rangeResult.proof.commitment);
+    const proof = {
+        proofId: nodeCrypto.randomUUID(),
+        proofType: 'trust-tier',
+        agentId,
+        tierCommitment,
+        tier,
+        proof: rangeResult.proof.proof,
+        validUntil: new Date(Date.now() + validityDurationMs),
+        createdAt: new Date(),
+    };
+    return { proof, secret: rangeResult.secret };
+}
+/**
+ * Verify a trust tier proof
+ */
+export function verifyTrustTierProof(proof) {
+    // Check validity period
+    if (new Date() > proof.validUntil) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: 'Proof has expired',
+        };
+    }
+    const tierRange = TIER_BOUNDARIES[proof.tier];
+    if (!tierRange) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: 'Invalid tier',
+        };
+    }
+    // Verify the embedded proof data directly
+    try {
+        const proofData = JSON.parse(Buffer.from(proof.proof, 'base64').toString());
+        // Verify challenge is present and properly formed
+        if (!proofData.challenge || !proofData.response) {
+            return {
+                valid: false,
+                proofId: proof.proofId,
+                verifiedAt: new Date(),
+                reason: 'Missing proof components',
+            };
+        }
+        // Verify tier commitment includes agent ID and tier
+        const expectedTierCommitment = hash(proof.agentId, proof.tier, proofData.bitCommitments?.[0] ?? '');
+        // Note: In a full implementation, we'd verify the commitment chain
+        return {
+            valid: true,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+        };
+    }
+    catch (error) {
+        return {
+            valid: false,
+            proofId: proof.proofId,
+            verifiedAt: new Date(),
+            reason: `Proof parsing failed: ${error instanceof Error ? error.message : 'Unknown'}`,
+        };
+    }
+}
+const DEFAULT_CONFIG = {
+    defaultValidityMs: 3600000, // 1 hour
+    enableCaching: true,
+    maxCacheSize: 1000,
+};
+/**
+ * Zero-Knowledge Proof Service
+ */
+export class ZKProofService {
+    config;
+    proofCache = new Map();
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+        logger.info('ZK proof service initialized');
+    }
+    /**
+     * Generate trust tier proof for an agent
+     */
+    generateTierProof(agentId, score, tier) {
+        const result = generateTrustTierProof(agentId, score, tier, this.config.defaultValidityMs);
+        if (!result) {
+            return null;
+        }
+        if (this.config.enableCaching) {
+            this.cacheProof(result.proof);
+        }
+        return result.proof;
+    }
+    /**
+     * Verify any ZK proof
+     */
+    verify(proof, context) {
+        switch (proof.proofType) {
+            case 'range':
+                return verifyRangeProof(proof);
+            case 'threshold':
+                return verifyThresholdProof(proof);
+            case 'membership':
+                if (!context?.allowedSet) {
+                    return {
+                        valid: false,
+                        proofId: proof.proofId,
+                        verifiedAt: new Date(),
+                        reason: 'Allowed set required for membership proof',
+                    };
+                }
+                return verifyMembershipProof(proof, context.allowedSet);
+            case 'trust-tier':
+                return verifyTrustTierProof(proof);
+            default:
+                return {
+                    valid: false,
+                    proofId: proof.proofId,
+                    verifiedAt: new Date(),
+                    reason: 'Unknown proof type',
+                };
+        }
+    }
+    /**
+     * Get cached proof for agent
+     */
+    getCachedProof(agentId, tier) {
+        const cacheKey = `${agentId}:${tier}`;
+        const proof = this.proofCache.get(cacheKey);
+        if (proof && new Date() < proof.validUntil) {
+            return proof;
+        }
+        // Remove expired proof
+        this.proofCache.delete(cacheKey);
+        return undefined;
+    }
+    /**
+     * Cache a proof
+     */
+    cacheProof(proof) {
+        // Enforce cache size limit
+        if (this.proofCache.size >= this.config.maxCacheSize) {
+            const oldestKey = this.proofCache.keys().next().value;
+            if (oldestKey) {
+                this.proofCache.delete(oldestKey);
+            }
+        }
+        const cacheKey = `${proof.agentId}:${proof.tier}`;
+        this.proofCache.set(cacheKey, proof);
+    }
+    /**
+     * Clear expired proofs from cache
+     */
+    cleanupCache() {
+        const now = new Date();
+        let cleaned = 0;
+        for (const [key, proof] of this.proofCache) {
+            if (now > proof.validUntil) {
+                this.proofCache.delete(key);
+                cleaned++;
+            }
+        }
+        return cleaned;
+    }
+    /**
+     * Get statistics
+     */
+    getStats() {
+        return {
+            cachedProofs: this.proofCache.size,
+            cacheHitRate: 0, // Would need request tracking for accurate rate
+        };
+    }
+}
+/**
+ * Create a ZK proof service
+ */
+export function createZKProofService(config) {
+    return new ZKProofService(config);
+}
+//# sourceMappingURL=zk-proofs.js.map

package/dist/proof/zk-proofs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zk-proofs.js","sourceRoot":"","sources":["../../src/proof/zk-proofs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,UAAU,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;AA4FvD;;GAEG;AACH,MAAM,eAAe,GAAqC;IACxD,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;IACX,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IACd,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IACd,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IACd,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IACd,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC;CAChB,CAAC;AAEF,gFAAgF;AAChF,2BAA2B;AAC3B,gFAAgF;AAEhF;;GAEG;AACH,SAAS,YAAY;IACnB,OAAO,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,SAAS,IAAI,CAAC,GAAG,MAAgB;IAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAEhC,2BAA2B;IAC3B,6CAA6C;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC;IAEpD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,UAAkB,EAClB,KAAa,EACb,QAAgB;IAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC;IAClD,OAAO,UAAU,KAAK,QAAQ,CAAC;AACjC,CAAC;AAED,gFAAgF;AAChF,eAAe;AACf,gFAAgF;AAEhF;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAa,EACb,GAAW,EACX,GAAW;IAEX,iBAAiB;IACjB,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,oBAAoB,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oBAAoB;IACpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAE3C,sBAAsB;IACtB,2EAA2E;IAC3E,6DAA6D;IAE7D,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,CAAC;IAC5B,MAAM,eAAe,GAAG,KAAK,GAAG,GAAG,CAAC;IAEpC,wCAAwC;IACxC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,IAAI,GAAG,eAAe,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACpB,IAAI,KAAK,CAAC,CAAC;IACb,CAAC;IAED,yBAAyB;IACzB,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAC9C,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,0BAA0B;IAC1B,MAAM,SAAS,GAAG,IAAI,CACpB,UAAU,CAAC,UAAU,EACrB,GAAG,CAAC,QAAQ,EAAE,EACd,GAAG,CAAC,QAAQ,EAAE,EACd,GAAG,cAAc,CAClB,CAAC;IAEF,WAAW;IACX,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,QAAQ,EAAE,GAAG,YAAY,CAAC,CAAC;IAEvE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,cAAc;QACd,SAAS;QACT,QAAQ;KACT,CAAC,CAAC;IAEH,MAAM,KAAK,GAAe;QACxB,OAAO,EAAE,UAAU,CAAC,UAAU,EAAE;QAChC,SAAS,EAAE,OAAO;QAClB,UAAU,EAAE,UAAU,CAAC,UAAU;QACjC,QAAQ,EAAE,GAAG;QACb,QAAQ,EAAE,GAAG;QACb,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAChD,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACvC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAiB;IAChD,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE5E,sBAAsB;QACtB,MAAM,iBAAiB,GAAG,IAAI,CAC5B,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,EACzB,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,EACzB,GAAG,SAAS,CAAC,cAAc,CAC5B,CAAC;QAEF,IAAI,SAAS,CAAC,SAAS,KAAK,iBAAiB,EAAE,CAAC;YAC9C,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,MAAM,EAAE,oBAAoB;aAC7B,CAAC;QACJ,CAAC;QAED,6CAA6C;QAC7C,2CAA2C;QAC3C,4CAA4C;QAC5C,6BAA6B;QAE7B,OAAO;YACL,KAAK,EAAE,IAAI;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,yBAAyB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;SACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAa,EACb,SAAiB;IAEjB,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,uBAAuB,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAE3C,iDAAiD;IACjD,MAAM,UAAU,GAAG,KAAK,GAAG,SAAS,CAAC;IACrC,MAAM,cAAc,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAEpD,MAAM,SAAS,GAAG,IAAI,CACpB,UAAU,CAAC,UAAU,EACrB,SAAS,CAAC,QAAQ,EAAE,EACpB,cAAc,CAAC,UAAU,CAC1B,CAAC;IAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,CAAC;IAE/E,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,oBAAoB,EAAE,cAAc,CAAC,UAAU;QAC/C,SAAS;QACT,QAAQ;KACT,CAAC,CAAC;IAEH,MAAM,KAAK,GAAmB;QAC5B,OAAO,EAAE,UAAU,CAAC,UAAU,EAAE;QAChC,SAAS,EAAE,WAAW;QACtB,UAAU,EAAE,UAAU,CAAC,UAAU;QACjC,SAAS;QACT,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAChD,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAqB;IACxD,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE5E,MAAM,iBAAiB,GAAG,IAAI,CAC5B,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,EAC1B,SAAS,CAAC,oBAAoB,CAC/B,CAAC;QAEF,IAAI,SAAS,CAAC,SAAS,KAAK,iBAAiB,EAAE,CAAC;YAC9C,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,MAAM,EAAE,oBAAoB;aAC7B,CAAC;QACJ,CAAC;QAED,OAAO;YACL,KAAK,EAAE,IAAI;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,yBAAyB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;SACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAa,EACb,UAAoB;IAEpB,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,0BAA0B,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uBAAuB;IACvB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IAE3C,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAE7C,6BAA6B;IAC7B,qDAAqD;IACrD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;YACrB,8BAA8B;YAC9B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,sCAAsC;YACtC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,SAAS;QACT,SAAS;QACT,aAAa;KACd,CAAC,CAAC;IAEH,MAAM,KAAK,GAAoB;QAC7B,OAAO,EAAE,UAAU,CAAC,UAAU,EAAE;QAChC,SAAS,EAAE,YAAY;QACvB,UAAU;QACV,OAAO;QACP,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAChD,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAsB,EACtB,UAAoB;IAEpB,IAAI,CAAC;QACH,kBAAkB;QAClB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;QACnD,IAAI,KAAK,CAAC,OAAO,KAAK,eAAe,EAAE,CAAC;YACtC,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,MAAM,EAAE,mBAAmB;aAC5B,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE5E,mBAAmB;QACnB,MAAM,iBAAiB,GAAG,IAAI,CAC5B,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,OAAO,EACb,GAAG,SAAS,CAAC,SAAS,CACvB,CAAC;QAEF,IAAI,SAAS,CAAC,SAAS,KAAK,iBAAiB,EAAE,CAAC;YAC9C,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,MAAM,EAAE,oBAAoB;aAC7B,CAAC;QACJ,CAAC;QAED,OAAO;YACL,KAAK,EAAE,IAAI;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,yBAAyB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;SACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,OAAe,EACf,KAAa,EACb,IAAY,EACZ,qBAA6B,OAAO,CAAC,SAAS;;IAE9C,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,cAAc,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC;IAE7B,0BAA0B;IAC1B,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,yBAAyB,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uBAAuB;IACvB,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACxD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yBAAyB;IACzB,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAEzE,MAAM,KAAK,GAAmB;QAC5B,OAAO,EAAE,UAAU,CAAC,UAAU,EAAE;QAChC,SAAS,EAAE,YAAY;QACvB,OAAO;QACP,cAAc;QACd,IAAI;QACJ,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK;QAC9B,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,kBAAkB,CAAC;QACrD,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAqB;IACxD,wBAAwB;IACxB,IAAI,IAAI,IAAI,EAAE,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAClC,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,mBAAmB;SAC5B,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,cAAc;SACvB,CAAC;IACJ,CAAC;IAED,0CAA0C;IAC1C,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE5E,kDAAkD;QAClD,IAAI,CAAC,SAAS,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;YAChD,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,MAAM,EAAE,0BAA0B;aACnC,CAAC;QACJ,CAAC;QAED,oDAAoD;QACpD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACpG,mEAAmE;QAEnE,OAAO;YACL,KAAK,EAAE,IAAI;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,MAAM,EAAE,yBAAyB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;SACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAkBD,MAAM,cAAc,GAAkB;IACpC,iBAAiB,EAAE,OAAO,EAAE,SAAS;IACrC,aAAa,EAAE,IAAI;IACnB,YAAY,EAAE,IAAI;CACnB,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,cAAc;IACjB,MAAM,CAAgB;IACtB,UAAU,GAAgC,IAAI,GAAG,EAAE,CAAC;IAE5D,YAAY,SAAiC,EAAE;QAC7C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;QAC/C,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,iBAAiB,CACf,OAAe,EACf,KAAa,EACb,IAAY;QAEZ,MAAM,MAAM,GAAG,sBAAsB,CACnC,OAAO,EACP,KAAK,EACL,IAAI,EACJ,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAC9B,CAAC;QAEF,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,MAAM,CACJ,KAAqE,EACrE,OAAmC;QAEnC,QAAQ,KAAK,CAAC,SAAS,EAAE,CAAC;YACxB,KAAK,OAAO;gBACV,OAAO,gBAAgB,CAAC,KAAmB,CAAC,CAAC;YAE/C,KAAK,WAAW;gBACd,OAAO,oBAAoB,CAAC,KAAuB,CAAC,CAAC;YAEvD,KAAK,YAAY;gBACf,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC;oBACzB,OAAO;wBACL,KAAK,EAAE,KAAK;wBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;wBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;wBACtB,MAAM,EAAE,2CAA2C;qBACpD,CAAC;gBACJ,CAAC;gBACD,OAAO,qBAAqB,CAAC,KAAwB,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAE7E,KAAK,YAAY;gBACf,OAAO,oBAAoB,CAAC,KAAuB,CAAC,CAAC;YAEvD;gBACE,OAAO;oBACL,KAAK,EAAE,KAAK;oBACZ,OAAO,EAAG,KAA6B,CAAC,OAAO;oBAC/C,UAAU,EAAE,IAAI,IAAI,EAAE;oBACtB,MAAM,EAAE,oBAAoB;iBAC7B,CAAC;QACN,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,OAAe,EAAE,IAAY;QAC1C,MAAM,QAAQ,GAAG,GAAG,OAAO,IAAI,IAAI,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE5C,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;YAC3C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,uBAAuB;QACvB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAqB;QACtC,2BAA2B;QAC3B,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACrD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YACtD,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,GAAG,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,YAAY;QACV,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,IAAI,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC5B,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ;QAIN,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAClC,YAAY,EAAE,CAAC,EAAE,gDAAgD;SAClE,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAA+B;IAClE,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC;AACpC,CAAC"}

package/dist/sandbox-training/challenges.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Sandbox Adversarial Training Boot Camp — Challenge Catalog
+ *
+ * 21 built-in challenges (7 per T1 factor) with escalating difficulty
+ * and adversarial injections.
+ *
+ * @packageDocumentation
+ */
+import type { Challenge, T1Factor, ChallengeDifficulty } from './types.js';
+/** Complete challenge catalog (21 challenges) */
+export declare const CHALLENGE_CATALOG: readonly Challenge[];
+/**
+ * Get challenges filtered by factor and/or difficulty.
+ */
+export declare function getChallengesByFactor(factor?: T1Factor, difficulty?: ChallengeDifficulty): Challenge[];
+//# sourceMappingURL=challenges.d.ts.map

package/dist/sandbox-training/challenges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"challenges.d.ts","sourceRoot":"","sources":["../../src/sandbox-training/challenges.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAijB3E,iDAAiD;AACjD,eAAO,MAAM,iBAAiB,EAAE,SAAS,SAAS,EAIxC,CAAC;AAEX;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,CAAC,EAAE,QAAQ,EACjB,UAAU,CAAC,EAAE,mBAAmB,GAC/B,SAAS,EAAE,CASb"}