@atrib/verify 0.1.0

package/dist/calculate.js

@@ -0,0 +1,495 @@
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * §4.6.1 / §4.2 / §4.5.2 Rule 6: validate a policy document.
+ * Returns true iff the policy is structurally usable for calculation.
+ *
+ * Reasons a policy fails validation:
+ * - missing or wrong spec_version
+ * - contradictory constraints (minimum_share > maximum_share)
+ * - any negative constraint value
+ * - any negative edge weight
+ */
+export function isValidPolicy(policy) {
+    if (!policy || typeof policy !== 'object')
+        return false;
+    const p = policy;
+    if (p.spec_version !== 'atrib/1.0')
+        return false;
+    if (p.edge_weights !== undefined) {
+        if (typeof p.edge_weights !== 'object' || p.edge_weights === null)
+            return false;
+        for (const v of Object.values(p.edge_weights)) {
+            if (typeof v !== 'number' || v < 0 || Number.isNaN(v))
+                return false;
+        }
+    }
+    if (p.constraints !== undefined) {
+        if (typeof p.constraints !== 'object' || p.constraints === null)
+            return false;
+        const c = p.constraints;
+        for (const v of Object.values(c)) {
+            if (v !== undefined && (typeof v !== 'number' || v < 0 || Number.isNaN(v)))
+                return false;
+        }
+        const minShare = c.minimum_share;
+        const maxShare = c.maximum_share;
+        if (minShare !== undefined && maxShare !== undefined && minShare > maxShare)
+            return false;
+    }
+    return true;
+}
+/** §4.3 default policy. */
+export const DEFAULT_POLICY = {
+    spec_version: 'atrib/1.0',
+    policy_id: 'https://atrib.dev/policies/default/v1',
+    role: 'default',
+    edge_weights: {
+        CHAIN_PRECEDES: 1.0,
+        SESSION_PRECEDES: 1.0,
+        SESSION_PARALLEL: 1.0,
+        CONVERGES_ON: 1.0,
+        CROSS_SESSION: 1.0,
+        unsigned: 0.0,
+    },
+    modifiers: [],
+    distribution: 'proportional',
+    constraints: {},
+};
+/**
+ * Run the full calculation pipeline (§4.6 closing pseudocode).
+ *
+ * @param graph. graph snapshot for the session
+ * @param policy. agreed policy document
+ * @param sessionPolicyRecord. optional; provides per-creator floors (§4.6.7)
+ * @returns final distribution (creator_key → share, sums to 1.0 ± 1e-9)
+ */
+export function calculate(graph, policy, sessionPolicyRecord) {
+    // §4.6.1: precondition. must have at least one transaction node
+    const txNode = graph.nodes.find((n) => n.event_type === 'transaction');
+    if (!txNode) {
+        return {};
+    }
+    // §4.6.1: "P is a valid v1 policy document per the schema in §4.2. If
+    // validation fails, use the default policy."
+    const validatedPolicy = isValidPolicy(policy) ? policy : DEFAULT_POLICY;
+    // Step 1: identify contributing nodes
+    const contributing = identifyContributingNodes(graph);
+    // Step 2: compute raw scores
+    const rawScores = new Map();
+    for (const node of contributing) {
+        rawScores.set(node.id, rawScore(node, graph, validatedPolicy, txNode));
+    }
+    // Step 3: apply node-level constraints (per-node floor/cap on normalized fractions)
+    const constrained = applyConstraints(rawScores, validatedPolicy.constraints ?? {});
+    // Step 4: re-normalize
+    const normalized = finalNormalize(constrained);
+    // Step 5: aggregate by creator
+    const byCreator = aggregateByCreator(normalized, graph);
+    // Step 6: apply per-creator floors from session policy record
+    const creatorFloors = sessionPolicyRecord?.applied_constraints.minimum_floors ?? {};
+    const floored = applyCreatorFloors(byCreator, creatorFloors);
+    // Final renormalization, then convert Map → sorted plain object for determinism
+    return distributionFromMap(finalNormalize(floored));
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.2. Step 1: identify contributing nodes
+// ─────────────────────────────────────────────────────────────────────────────
+function identifyContributingNodes(graph) {
+    // A contributing node is `tool_call` or `gap_node` (NOT transaction,
+    // observation, or extension) AND has an edge to a transaction node
+    // (CONVERGES_ON or CROSS_SESSION). observation and extension records
+    // are graph nodes but are NOT participants in §4.6 calculation in v1
+    // (spec §3.2.1, §4.6.2).
+    const txNodeIds = new Set(graph.nodes.filter((n) => n.event_type === 'transaction').map((n) => n.id));
+    const hasEdgeToTx = new Set();
+    for (const edge of graph.edges) {
+        if ((edge.type === 'CONVERGES_ON' || edge.type === 'CROSS_SESSION') &&
+            txNodeIds.has(edge.target)) {
+            hasEdgeToTx.add(edge.source);
+        }
+    }
+    // Sort by id for deterministic iteration
+    return graph.nodes
+        .filter((n) => (n.event_type === 'tool_call' || n.event_type === 'gap_node') &&
+        hasEdgeToTx.has(n.id))
+        .sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0));
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.3. Step 2: raw scores
+// ─────────────────────────────────────────────────────────────────────────────
+function rawScore(node, graph, policy, txNode) {
+    const weights = policy.edge_weights ?? {};
+    // Step 2a: base weight from edge type
+    let base;
+    if (node.event_type === 'gap_node') {
+        base = weights.unsigned ?? 0.0;
+    }
+    else {
+        // Collect all edge types on paths from this node leading to a transaction
+        const edgeTypes = collectEdgeTypesToTransaction(node.id, graph);
+        if (edgeTypes.size === 0) {
+            base = 0.0;
+        }
+        else {
+            // §4.2.2 / §4.6.3: max() over all applicable edge weights
+            let max = -Infinity;
+            for (const t of edgeTypes) {
+                const w = weights[t] ?? 0.0;
+                if (w > max)
+                    max = w;
+            }
+            base = max === -Infinity ? 0.0 : max;
+        }
+    }
+    // Step 2b: apply modifiers in declared order
+    let score = base;
+    for (const modifier of policy.modifiers ?? []) {
+        score = applyModifier(modifier, score, node, graph, txNode);
+    }
+    return score < 0 ? 0 : score;
+}
+/**
+ * Collect every edge type that appears on any directed/undirected path from
+ * `nodeId` to any transaction node, including the direct CONVERGES_ON and
+ * CROSS_SESSION edges from the node itself.
+ *
+ * Per §4.6.3: "edge_types = {e.type for e in G.edges where e.source == n.id
+ * and G.nodes[e.target].event_type == 'transaction'}; also include
+ * CHAIN_PRECEDES and SESSION_* edges between non-transaction nodes that form
+ * a path leading to a transaction node"
+ */
+function collectEdgeTypesToTransaction(nodeId, graph) {
+    const txNodeIds = new Set(graph.nodes.filter((n) => n.event_type === 'transaction').map((n) => n.id));
+    const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));
+    // Traversal: BFS from nodeId following ANY outgoing edge (including
+    // SESSION_PARALLEL undirected, plus reverse direction which we treat as
+    // outgoing for path-finding). Collect every edge type encountered on
+    // edges that participate in a path reaching a transaction node.
+    //
+    // Implementation strategy: do a forward reachability search to find which
+    // nodes can reach a transaction. Then any edge whose source is in that set
+    // and whose path continues toward a transaction contributes its type.
+    //
+    // Simpler exact approach: for any node N, the edge types on N's "path to
+    // transaction" are the union of:
+    //   1. types of edges directly from N (or undirected involving N) whose
+    //      other endpoint can reach a transaction (or IS a transaction)
+    //   2. recursively, the path types from the next hop
+    //
+    // We compute this iteratively as a fixed-point set per node.
+    // Build adjacency: for each node, list (edgeType, neighborId) for both
+    // directed-out and undirected edges.
+    const adj = new Map();
+    for (const node of graph.nodes)
+        adj.set(node.id, []);
+    for (const edge of graph.edges) {
+        adj.get(edge.source)?.push({ type: edge.type, to: edge.target });
+        if (!edge.directed) {
+            adj.get(edge.target)?.push({ type: edge.type, to: edge.source });
+        }
+    }
+    // BFS forward from nodeId; collect edge types whose target either is a
+    // transaction node OR can reach a transaction.
+    // First compute "can reach transaction" set via reverse BFS from tx nodes.
+    const canReachTx = new Set(txNodeIds);
+    const reverseAdj = new Map();
+    for (const node of graph.nodes)
+        reverseAdj.set(node.id, []);
+    for (const edge of graph.edges) {
+        reverseAdj.get(edge.target)?.push(edge.source);
+        if (!edge.directed)
+            reverseAdj.get(edge.source)?.push(edge.target);
+    }
+    const reverseQueue = [...txNodeIds];
+    while (reverseQueue.length > 0) {
+        const curr = reverseQueue.shift();
+        for (const pred of reverseAdj.get(curr) ?? []) {
+            if (!canReachTx.has(pred)) {
+                canReachTx.add(pred);
+                reverseQueue.push(pred);
+            }
+        }
+    }
+    // Now BFS forward from nodeId, collecting edge types on edges whose target
+    // can reach a transaction.
+    const collected = new Set();
+    const visited = new Set([nodeId]);
+    const queue = [nodeId];
+    while (queue.length > 0) {
+        const curr = queue.shift();
+        for (const { type, to } of adj.get(curr) ?? []) {
+            // Only count edges that participate in a transaction-reaching path
+            if (!canReachTx.has(to))
+                continue;
+            // Skip edges leading to non-transaction nodes that still can reach tx,
+            // but include the edge type. Also include edges directly to tx nodes.
+            // Per §4.6.3, we collect both direct CONVERGES_ON edges and chain/session
+            // edges on paths leading to tx.
+            const targetNode = nodeMap.get(to);
+            if (!targetNode)
+                continue;
+            collected.add(type);
+            if (targetNode.event_type !== 'transaction' && !visited.has(to)) {
+                visited.add(to);
+                queue.push(to);
+            }
+        }
+    }
+    return collected;
+}
+function applyModifier(modifier, score, node, graph, txNode) {
+    if (modifier.type === 'temporal_decay') {
+        const halfLifeMs = modifier.half_life_ms;
+        const deltaMs = txNode.timestamp - node.timestamp;
+        if (deltaMs < 0)
+            return 0.0;
+        return score * Math.pow(2.0, -(deltaMs / halfLifeMs));
+    }
+    if (modifier.type === 'chain_depth_penalty') {
+        const penaltyPerLevel = modifier.penalty_per_level;
+        const depth = shortestChainPath(node.id, graph);
+        const factor = Math.max(0.0, 1.0 - depth * penaltyPerLevel);
+        return score * factor;
+    }
+    if (modifier.type === 'call_count_boost') {
+        const m = modifier;
+        const count = countNodesWithSameContentId(node.content_id, graph);
+        const factor = Math.min(m.cap, 1.0 + (count - 1) * m.multiplier_per_call);
+        return score * factor;
+    }
+    // Unknown modifier types are ignored (§4.6.3)
+    return score;
+}
+function shortestChainPath(nodeId, graph) {
+    // Hops via CHAIN_PRECEDES from this node to nearest transaction.
+    // Build chain-only adjacency.
+    const chainAdj = new Map();
+    for (const node of graph.nodes)
+        chainAdj.set(node.id, []);
+    for (const edge of graph.edges) {
+        if (edge.type === 'CHAIN_PRECEDES') {
+            chainAdj.get(edge.source)?.push(edge.target);
+        }
+    }
+    const txIds = new Set(graph.nodes.filter((n) => n.event_type === 'transaction').map((n) => n.id));
+    // BFS
+    const visited = new Set([nodeId]);
+    const queue = [{ id: nodeId, depth: 0 }];
+    while (queue.length > 0) {
+        const { id, depth } = queue.shift();
+        if (txIds.has(id))
+            return depth;
+        for (const next of chainAdj.get(id) ?? []) {
+            if (!visited.has(next)) {
+                visited.add(next);
+                queue.push({ id: next, depth: depth + 1 });
+            }
+        }
+    }
+    // No chain path to a transaction. return a large depth to fully penalize
+    return Number.MAX_SAFE_INTEGER;
+}
+function countNodesWithSameContentId(contentId, graph) {
+    if (!contentId)
+        return 1;
+    let count = 0;
+    for (const n of graph.nodes) {
+        if (n.content_id === contentId)
+            count++;
+    }
+    return count;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.4. Step 3: apply constraints
+// ─────────────────────────────────────────────────────────────────────────────
+function applyConstraints(rawScores, constraints) {
+    // Filter to positive contributors
+    const contributors = new Map();
+    for (const [id, score] of rawScores) {
+        if (score > 0)
+            contributors.set(id, score);
+    }
+    if (contributors.size === 0)
+        return new Map();
+    // Initial proportional pass
+    let total = 0;
+    for (const s of contributors.values())
+        total += s;
+    let normalized = new Map();
+    for (const [id, s] of contributors)
+        normalized.set(id, s / total);
+    if (constraints.minimum_share !== undefined) {
+        normalized = applyMinimumFloor(normalized, constraints.minimum_share);
+    }
+    if (constraints.maximum_share !== undefined) {
+        normalized = applyMaximumCap(normalized, constraints.maximum_share);
+    }
+    return normalized;
+}
+function applyMinimumFloor(normalized, floor) {
+    const below = new Map();
+    const above = new Map();
+    for (const [id, s] of normalized) {
+        if (s < floor)
+            below.set(id, s);
+        else
+            above.set(id, s);
+    }
+    let boostNeeded = 0;
+    for (const s of below.values())
+        boostNeeded += floor - s;
+    let aboveTotal = 0;
+    for (const s of above.values())
+        aboveTotal += s;
+    const result = new Map();
+    if (aboveTotal <= boostNeeded) {
+        // Equal-distribution fallback
+        const equal = 1.0 / normalized.size;
+        for (const id of normalized.keys())
+            result.set(id, equal);
+        return result;
+    }
+    const scale = (aboveTotal - boostNeeded) / aboveTotal;
+    for (const id of below.keys())
+        result.set(id, floor);
+    for (const [id, s] of above)
+        result.set(id, s * scale);
+    return result;
+}
+function applyMaximumCap(normalized, cap) {
+    // Iterate until no entries exceed cap. Each pass caps at least one new
+    // entry, so the loop terminates in at most N passes. A safety bound
+    // prevents infinite loops if redistribution ping-pongs between entries
+    // (possible when cap * N < 1.0 and excess can't be absorbed).
+    let current = normalized;
+    const maxIters = normalized.size + 1;
+    for (let iter = 0; iter < maxIters; iter++) {
+        const above = new Map();
+        const below = new Map();
+        for (const [id, s] of current) {
+            if (s > cap)
+                above.set(id, s);
+            else
+                below.set(id, s);
+        }
+        if (above.size === 0)
+            return current;
+        let excess = 0;
+        for (const s of above.values())
+            excess += s - cap;
+        let belowTotal = 0;
+        for (const s of below.values())
+            belowTotal += s;
+        const result = new Map();
+        for (const id of above.keys())
+            result.set(id, cap);
+        if (belowTotal > 0) {
+            const scale = (belowTotal + excess) / belowTotal;
+            for (const [id, s] of below)
+                result.set(id, s * scale);
+        }
+        else {
+            for (const [id, s] of below)
+                result.set(id, s);
+        }
+        current = result;
+    }
+    // Safety: if we exhaust iterations (ping-pong), cap everyone at cap
+    // and let finalNormalize handle the sum.
+    const result = new Map();
+    for (const [id, s] of current)
+        result.set(id, Math.min(s, cap));
+    return result;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.5. Step 4: final normalize
+// ─────────────────────────────────────────────────────────────────────────────
+function finalNormalize(shares) {
+    let total = 0;
+    for (const s of shares.values())
+        total += s;
+    // Guard against zero, near-zero (denormalized), and NaN totals
+    if (!Number.isFinite(total) || total <= 0)
+        return new Map();
+    const result = new Map();
+    for (const [k, s] of shares) {
+        const normalized = s / total;
+        // Guard against NaN/Infinity from division of very small numbers
+        result.set(k, Number.isFinite(normalized) ? normalized : 0);
+    }
+    return result;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.6. Step 5: aggregate by creator
+// ─────────────────────────────────────────────────────────────────────────────
+function aggregateByCreator(normalized, graph) {
+    const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));
+    const byCreator = new Map();
+    // Sort node ids for deterministic accumulation order
+    const sortedIds = [...normalized.keys()].sort();
+    for (const id of sortedIds) {
+        const share = normalized.get(id);
+        const node = nodeMap.get(id);
+        if (!node)
+            continue;
+        const key = node.creator_key ?? '__unsigned__';
+        byCreator.set(key, (byCreator.get(key) ?? 0) + share);
+    }
+    return byCreator;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// §4.6.7. Step 6: apply creator floors
+// ─────────────────────────────────────────────────────────────────────────────
+function applyCreatorFloors(byCreator, creatorFloors) {
+    const floorEntries = Object.entries(creatorFloors);
+    if (floorEntries.length === 0)
+        return byCreator;
+    const result = new Map(byCreator);
+    const flooredKeys = new Set();
+    // Identify creators below their floor (sorted for determinism)
+    for (const [key, floor] of floorEntries.sort((a, b) => (a[0] < b[0] ? -1 : 1))) {
+        if (!result.has(key))
+            continue;
+        if ((result.get(key) ?? 0) < floor)
+            flooredKeys.add(key);
+    }
+    if (flooredKeys.size === 0)
+        return result;
+    let boostNeeded = 0;
+    for (const k of flooredKeys)
+        boostNeeded += creatorFloors[k] - (result.get(k) ?? 0);
+    const nonFloored = new Map();
+    for (const [k, v] of result) {
+        if (!flooredKeys.has(k))
+            nonFloored.set(k, v);
+    }
+    let nonFlooredTotal = 0;
+    for (const v of nonFloored.values())
+        nonFlooredTotal += v;
+    if (nonFlooredTotal <= boostNeeded) {
+        // Cannot honor. should have been caught at negotiation. Return unchanged.
+        return result;
+    }
+    const scale = (nonFlooredTotal - boostNeeded) / nonFlooredTotal;
+    // Use sorted iteration to keep result construction deterministic
+    for (const k of [...flooredKeys].sort()) {
+        result.set(k, creatorFloors[k]);
+    }
+    for (const [k, v] of [...nonFloored.entries()].sort((a, b) => (a[0] < b[0] ? -1 : 1))) {
+        result.set(k, v * scale);
+    }
+    return result;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Helpers for converting Map → plain Distribution object (for output)
+// ─────────────────────────────────────────────────────────────────────────────
+/** Convert a Map<creator_key, share> to a sorted plain object distribution. */
+function distributionFromMap(map) {
+    const result = {};
+    // Sort keys for deterministic JSON ordering
+    for (const k of [...map.keys()].sort()) {
+        result[k] = map.get(k);
+    }
+    return result;
+}
+//# sourceMappingURL=calculate.js.map

package/dist/calculate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calculate.js","sourceRoot":"","sources":["../src/calculate.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAsBtC;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,MAAe;IAC3C,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAA;IACvD,MAAM,CAAC,GAAG,MAAiC,CAAA;IAC3C,IAAI,CAAC,CAAC,YAAY,KAAK,WAAW;QAAE,OAAO,KAAK,CAAA;IAEhD,IAAI,CAAC,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACjC,IAAI,OAAO,CAAC,CAAC,YAAY,KAAK,QAAQ,IAAI,CAAC,CAAC,YAAY,KAAK,IAAI;YAAE,OAAO,KAAK,CAAA;QAC/E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,YAAuC,CAAC,EAAE,CAAC;YACzE,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;QACrE,CAAC;IACH,CAAC;IAED,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI;YAAE,OAAO,KAAK,CAAA;QAC7E,MAAM,CAAC,GAAG,CAAC,CAAC,WAAsC,CAAA;QAClD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;QAC1F,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,aAAmC,CAAA;QACtD,MAAM,QAAQ,GAAG,CAAC,CAAC,aAAmC,CAAA;QACtD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,QAAQ;YAAE,OAAO,KAAK,CAAA;IAC3F,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED,2BAA2B;AAC3B,MAAM,CAAC,MAAM,cAAc,GAAmB;IAC5C,YAAY,EAAE,WAAW;IACzB,SAAS,EAAE,uCAAuC;IAClD,IAAI,EAAE,SAAS;IACf,YAAY,EAAE;QACZ,cAAc,EAAE,GAAG;QACnB,gBAAgB,EAAE,GAAG;QACrB,gBAAgB,EAAE,GAAG;QACrB,YAAY,EAAE,GAAG;QACjB,aAAa,EAAE,GAAG;QAClB,QAAQ,EAAE,GAAG;KACd;IACD,SAAS,EAAE,EAAE;IACb,YAAY,EAAE,cAAc;IAC5B,WAAW,EAAE,EAAE;CAChB,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CACvB,KAAoB,EACpB,MAAsB,EACtB,mBAAgD;IAEhD,gEAAgE;IAChE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC,CAAA;IACtE,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,CAAA;IACX,CAAC;IAED,sEAAsE;IACtE,6CAA6C;IAC7C,MAAM,eAAe,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAA;IAEvE,sCAAsC;IACtC,MAAM,YAAY,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAA;IAErD,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC3C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC,CAAA;IACxE,CAAC;IAED,oFAAoF;IACpF,MAAM,WAAW,GAAG,gBAAgB,CAAC,SAAS,EAAE,eAAe,CAAC,WAAW,IAAI,EAAE,CAAC,CAAA;IAElF,uBAAuB;IACvB,MAAM,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,CAAA;IAE9C,+BAA+B;IAC/B,MAAM,SAAS,GAAG,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IAEvD,8DAA8D;IAC9D,MAAM,aAAa,GAAG,mBAAmB,EAAE,mBAAmB,CAAC,cAAc,IAAI,EAAE,CAAA;IACnF,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAA;IAE5D,gFAAgF;IAChF,OAAO,mBAAmB,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAA;AACrD,CAAC;AAED,gFAAgF;AAChF,8CAA8C;AAC9C,gFAAgF;AAEhF,SAAS,yBAAyB,CAAC,KAAoB;IACrD,qEAAqE;IACrE,mEAAmE;IACnE,qEAAqE;IACrE,qEAAqE;IACrE,yBAAyB;IACzB,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC3E,CAAA;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IACE,CAAC,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,CAAC;YAC/D,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAC1B,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IACD,yCAAyC;IACzC,OAAO,KAAK,CAAC,KAAK;SACf,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,UAAU,KAAK,WAAW,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC;QAC7D,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CACxB;SACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC7D,CAAC;AAED,gFAAgF;AAChF,6BAA6B;AAC7B,gFAAgF;AAEhF,SAAS,QAAQ,CACf,IAAe,EACf,KAAoB,EACpB,MAAsB,EACtB,MAAiB;IAEjB,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,IAAI,EAAE,CAAA;IAEzC,sCAAsC;IACtC,IAAI,IAAY,CAAA;IAChB,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;QACnC,IAAI,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAA;IAChC,CAAC;SAAM,CAAC;QACN,0EAA0E;QAC1E,MAAM,SAAS,GAAG,6BAA6B,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QAC/D,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,GAAG,GAAG,CAAA;QACZ,CAAC;aAAM,CAAC;YACN,0DAA0D;YAC1D,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAA;YACnB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAI,OAA8C,CAAC,CAAC,CAAC,IAAI,GAAG,CAAA;gBACnE,IAAI,CAAC,GAAG,GAAG;oBAAE,GAAG,GAAG,CAAC,CAAA;YACtB,CAAC;YACD,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;QACtC,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,IAAI,KAAK,GAAG,IAAI,CAAA;IAChB,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAC9C,KAAK,GAAG,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;IAC7D,CAAC;IAED,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;AAC9B,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,6BAA6B,CAAC,MAAc,EAAE,KAAoB;IACzE,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC3E,CAAA;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAE1D,oEAAoE;IACpE,wEAAwE;IACxE,qEAAqE;IACrE,gEAAgE;IAChE,EAAE;IACF,0EAA0E;IAC1E,2EAA2E;IAC3E,sEAAsE;IACtE,EAAE;IACF,yEAAyE;IACzE,iCAAiC;IACjC,wEAAwE;IACxE,oEAAoE;IACpE,qDAAqD;IACrD,EAAE;IACF,6DAA6D;IAE7D,uEAAuE;IACvE,qCAAqC;IACrC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAiD,CAAA;IACpE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QAChE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QAClE,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,+CAA+C;IAC/C,2EAA2E;IAC3E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,SAAS,CAAC,CAAA;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;QAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IAC3D,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC9C,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACpE,CAAC;IACD,MAAM,YAAY,GAAa,CAAC,GAAG,SAAS,CAAC,CAAA;IAC7C,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAG,CAAA;QAClC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACpB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,2BAA2B;IAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAA;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAA;IACzC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAA;IAChC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,mEAAmE;YACnE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAQ;YACjC,uEAAuE;YACvE,sEAAsE;YACtE,0EAA0E;YAC1E,gCAAgC;YAChC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAClC,IAAI,CAAC,UAAU;gBAAE,SAAQ;YACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACnB,IAAI,UAAU,CAAC,UAAU,KAAK,aAAa,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,aAAa,CACpB,QAAkB,EAClB,KAAa,EACb,IAAe,EACf,KAAoB,EACpB,MAAiB;IAEjB,IAAI,QAAQ,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACvC,MAAM,UAAU,GAAI,QAAqC,CAAC,YAAY,CAAA;QACtE,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;QACjD,IAAI,OAAO,GAAG,CAAC;YAAE,OAAO,GAAG,CAAA;QAC3B,OAAO,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,CAAC,CAAA;IACvD,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;QAC5C,MAAM,eAAe,GAAI,QAA0C,CAAC,iBAAiB,CAAA;QACrF,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,KAAK,GAAG,eAAe,CAAC,CAAA;QAC3D,OAAO,KAAK,GAAG,MAAM,CAAA;IACvB,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAwD,CAAA;QAClE,MAAM,KAAK,GAAG,2BAA2B,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAA;QACzE,OAAO,KAAK,GAAG,MAAM,CAAA;IACvB,CAAC;IACD,8CAA8C;IAC9C,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,iBAAiB,CAAC,MAAc,EAAE,KAAoB;IAC7D,iEAAiE;IACjE,8BAA8B;IAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IACzD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YACnC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC9C,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjG,MAAM;IACN,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAA;IAEzC,MAAM,KAAK,GAAW,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;IAChD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QACpC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAA;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACjB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAA;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IACD,yEAAyE;IACzE,OAAO,MAAM,CAAC,gBAAgB,CAAA;AAChC,CAAC;AAED,SAAS,2BAA2B,CAAC,SAAwB,EAAE,KAAoB;IACjF,IAAI,CAAC,SAAS;QAAE,OAAO,CAAC,CAAA;IACxB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS;YAAE,KAAK,EAAE,CAAA;IACzC,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,gFAAgF;AAChF,oCAAoC;AACpC,gFAAgF;AAEhF,SAAS,gBAAgB,CACvB,SAA8B,EAC9B,WAA8B;IAE9B,kCAAkC;IAClC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC9C,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,IAAI,KAAK,GAAG,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;IAC5C,CAAC;IACD,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAA;IAE7C,4BAA4B;IAC5B,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,EAAE;QAAE,KAAK,IAAI,CAAC,CAAA;IACjD,IAAI,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,YAAY;QAAE,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAA;IAEjE,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;QAC5C,UAAU,GAAG,iBAAiB,CAAC,UAAU,EAAE,WAAW,CAAC,aAAa,CAAC,CAAA;IACvE,CAAC;IACD,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;QAC5C,UAAU,GAAG,eAAe,CAAC,UAAU,EAAE,WAAW,CAAC,aAAa,CAAC,CAAA;IACrE,CAAC;IAED,OAAO,UAAU,CAAA;AACnB,CAAC;AAED,SAAS,iBAAiB,CAAC,UAA+B,EAAE,KAAa;IACvE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QACjC,IAAI,CAAC,GAAG,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;;YAC1B,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IACvB,CAAC;IACD,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;QAAE,WAAW,IAAI,KAAK,GAAG,CAAC,CAAA;IACxD,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;QAAE,UAAU,IAAI,CAAC,CAAA;IAE/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,IAAI,UAAU,IAAI,WAAW,EAAE,CAAC;QAC9B,8BAA8B;QAC9B,MAAM,KAAK,GAAG,GAAG,GAAG,UAAU,CAAC,IAAI,CAAA;QACnC,KAAK,MAAM,EAAE,IAAI,UAAU,CAAC,IAAI,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QACzD,OAAO,MAAM,CAAA;IACf,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,WAAW,CAAC,GAAG,UAAU,CAAA;IACrD,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;IACpD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAA;IACtD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,eAAe,CAAC,UAA+B,EAAE,GAAW;IACnE,uEAAuE;IACvE,oEAAoE;IACpE,uEAAuE;IACvE,8DAA8D;IAC9D,IAAI,OAAO,GAAG,UAAU,CAAA;IACxB,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,GAAG,CAAC,CAAA;IACpC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;QACvC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;QACvC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,GAAG;gBAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;;gBACxB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QACvB,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,OAAO,CAAA;QAEpC,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;YAAE,MAAM,IAAI,CAAC,GAAG,GAAG,CAAA;QACjD,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;YAAE,UAAU,IAAI,CAAC,CAAA;QAE/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;QACxC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QAClD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,UAAU,CAAA;YAChD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAA;QACxD,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QAChD,CAAC;QACD,OAAO,GAAG,MAAM,CAAA;IAClB,CAAC;IACD,oEAAoE;IACpE,yCAAyC;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,OAAO;QAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;IAC/D,OAAO,MAAM,CAAA;AACf,CAAC;AAED,gFAAgF;AAChF,kCAAkC;AAClC,gFAAgF;AAEhF,SAAS,cAAc,CAAI,MAAsB;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;QAAE,KAAK,IAAI,CAAC,CAAA;IAC3C,+DAA+D;IAC/D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAA;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAA;IACnC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAA;QAC5B,iEAAiE;QACjE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7D,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,gFAAgF;AAChF,uCAAuC;AACvC,gFAAgF;AAEhF,SAAS,kBAAkB,CACzB,UAA+B,EAC/B,KAAoB;IAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC3C,qDAAqD;IACrD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;IAC/C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAA;QACjC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC5B,IAAI,CAAC,IAAI;YAAE,SAAQ;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,cAAc,CAAA;QAC9C,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAA;IACvD,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,gFAAgF;AAChF,uCAAuC;AACvC,gFAAgF;AAEhF,SAAS,kBAAkB,CACzB,SAA8B,EAC9B,aAAqC;IAErC,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAA;IAClD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IAE/C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAA;IACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IAErC,+DAA+D;IAC/D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAQ;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC1D,CAAC;IACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAA;IAEzC,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,KAAK,MAAM,CAAC,IAAI,WAAW;QAAE,WAAW,IAAI,aAAa,CAAC,CAAC,CAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IACpF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/C,CAAC;IACD,IAAI,eAAe,GAAG,CAAC,CAAA;IACvB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE;QAAE,eAAe,IAAI,CAAC,CAAA;IAEzD,IAAI,eAAe,IAAI,WAAW,EAAE,CAAC;QACnC,0EAA0E;QAC1E,OAAO,MAAM,CAAA;IACf,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,eAAe,CAAA;IAC/D,iEAAiE;IACjE,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAE,CAAC,CAAA;IAClC,CAAC;IACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,gFAAgF;AAChF,sEAAsE;AACtE,gFAAgF;AAEhF,+EAA+E;AAC/E,SAAS,mBAAmB,CAAC,GAAwB;IACnD,MAAM,MAAM,GAAiB,EAAE,CAAA;IAC/B,4CAA4C;IAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;IACzB,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/graph-fetch.d.ts

@@ -0,0 +1,22 @@
+/**
+ * HTTP fetcher for graph snapshots and session policy records.
+ * Thin wrapper used by AtribVerifier.verify() / .calculate().
+ */
+import type { GraphResponse, SessionPolicyRecord, PolicyDocument } from './types.js';
+/**
+ * Fetch a graph snapshot for a context_id at a specific tree size (§3.4.1).
+ *
+ * @param graphEndpoint. base URL, e.g. "https://graph.atrib.dev/v1"
+ * @param contextId
+ * @param treeSize. optional; if provided, pins the graph to that log tree size
+ */
+export declare function fetchGraph(graphEndpoint: string, contextId: string, treeSize?: number): Promise<GraphResponse>;
+/**
+ * Fetch a session policy record by its record_id (§4.5.3).
+ */
+export declare function fetchSessionPolicyRecord(graphEndpoint: string, recordId: string): Promise<SessionPolicyRecord>;
+/**
+ * Fetch a policy document by URL (§4.4).
+ */
+export declare function fetchPolicyDocument(url: string): Promise<PolicyDocument>;
+//# sourceMappingURL=graph-fetch.d.ts.map

package/dist/graph-fetch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-fetch.d.ts","sourceRoot":"","sources":["../src/graph-fetch.ts"],"names":[],"mappings":"AAEA;;;GAGG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAA;AAIpF;;;;;;GAMG;AACH,wBAAsB,UAAU,CAC9B,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,MAAM,EACjB,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,aAAa,CAAC,CAYxB;AAED;;GAEG;AACH,wBAAsB,wBAAwB,CAC5C,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,mBAAmB,CAAC,CAO9B;AAED;;GAEG;AACH,wBAAsB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAW9E"}

package/dist/graph-fetch.js

@@ -0,0 +1,60 @@
+// SPDX-License-Identifier: Apache-2.0
+const DEFAULT_TIMEOUT_MS = 10_000;
+/**
+ * Fetch a graph snapshot for a context_id at a specific tree size (§3.4.1).
+ *
+ * @param graphEndpoint. base URL, e.g. "https://graph.atrib.dev/v1"
+ * @param contextId
+ * @param treeSize. optional; if provided, pins the graph to that log tree size
+ */
+export async function fetchGraph(graphEndpoint, contextId, treeSize) {
+    const params = new URLSearchParams({
+        include_gap_nodes: 'true',
+        include_cross_session: 'true',
+    });
+    if (treeSize !== undefined)
+        params.set('tree_size', String(treeSize));
+    const url = `${graphEndpoint.replace(/\/$/, '')}/graph/${contextId}?${params.toString()}`;
+    const res = await fetchWithTimeout(url);
+    if (!res.ok) {
+        throw new Error(`fetchGraph failed: ${res.status} ${res.statusText}`);
+    }
+    return (await res.json());
+}
+/**
+ * Fetch a session policy record by its record_id (§4.5.3).
+ */
+export async function fetchSessionPolicyRecord(graphEndpoint, recordId) {
+    const url = `${graphEndpoint.replace(/\/$/, '')}/policy-records/${encodeURIComponent(recordId)}`;
+    const res = await fetchWithTimeout(url);
+    if (!res.ok) {
+        throw new Error(`fetchSessionPolicyRecord failed: ${res.status} ${res.statusText}`);
+    }
+    return (await res.json());
+}
+/**
+ * Fetch a policy document by URL (§4.4).
+ */
+export async function fetchPolicyDocument(url) {
+    // Validate URL scheme to prevent SSRF via crafted agreed_policy URLs
+    const parsed = new URL(url);
+    if (parsed.protocol !== 'https:') {
+        throw new Error(`fetchPolicyDocument: only https: URLs are allowed, got ${parsed.protocol}`);
+    }
+    const res = await fetchWithTimeout(url);
+    if (!res.ok) {
+        throw new Error(`fetchPolicyDocument failed: ${res.status} ${res.statusText}`);
+    }
+    return (await res.json());
+}
+async function fetchWithTimeout(url, timeoutMs = DEFAULT_TIMEOUT_MS) {
+    const controller = new AbortController();
+    const timer = setTimeout(() => controller.abort(), timeoutMs);
+    try {
+        return await fetch(url, { signal: controller.signal });
+    }
+    finally {
+        clearTimeout(timer);
+    }
+}
+//# sourceMappingURL=graph-fetch.js.map

package/dist/graph-fetch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-fetch.js","sourceRoot":"","sources":["../src/graph-fetch.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAStC,MAAM,kBAAkB,GAAG,MAAM,CAAA;AAEjC;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,aAAqB,EACrB,SAAiB,EACjB,QAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC;QACjC,iBAAiB,EAAE,MAAM;QACzB,qBAAqB,EAAE,MAAM;KAC9B,CAAC,CAAA;IACF,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAA;IACrE,MAAM,GAAG,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,SAAS,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAA;IACzF,MAAM,GAAG,GAAG,MAAM,gBAAgB,CAAC,GAAG,CAAC,CAAA;IACvC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAkB,CAAA;AAC5C,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,aAAqB,EACrB,QAAgB;IAEhB,MAAM,GAAG,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,mBAAmB,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAA;IAChG,MAAM,GAAG,GAAG,MAAM,gBAAgB,CAAC,GAAG,CAAC,CAAA;IACvC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,oCAAoC,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC,CAAA;IACrF,CAAC;IACD,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAwB,CAAA;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,GAAW;IACnD,qEAAqE;IACrE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,IAAI,MAAM,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,0DAA0D,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAA;IAC9F,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,gBAAgB,CAAC,GAAG,CAAC,CAAA;IACvC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC,CAAA;IAChF,CAAC;IACD,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAmB,CAAA;AAC7C,CAAC;AAED,KAAK,UAAU,gBAAgB,CAAC,GAAW,EAAE,SAAS,GAAG,kBAAkB;IACzE,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAA;IACxC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAA;IAC7D,IAAI,CAAC;QACH,OAAO,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAA;IACxD,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,KAAK,CAAC,CAAA;IACrB,CAAC;AACH,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,15 @@
+export { AtribVerifier } from './verifier.js';
+export type { AtribVerifierOptions, CalculateOptions } from './verifier.js';
+export { verifyRecord } from './verify-record.js';
+export type { RecordVerificationResult, ProvenanceAnnotation, VerifyRecordOptions, } from './verify-record.js';
+export { calculate, DEFAULT_POLICY, isValidPolicy } from './calculate.js';
+export { signRecommendation, verifyRecommendationSignature, recommendationSigningInput, distributionsMatch, } from './recommendation.js';
+export { buildPolicy, policyFrom } from './policy-builder.js';
+export { fetchGraph, fetchSessionPolicyRecord, fetchPolicyDocument } from './graph-fetch.js';
+export { buildRevocationRegistry, applyRevocation } from './revocations.js';
+export type { RevocationEntry, RevocationReason, MinimalRecord } from './revocations.js';
+export { resolveIdentity } from './resolve-identity.js';
+export type { IdentityResolution, IdentityResolutionMethod, KeyRevocationStatus, ResolveIdentityOptions, IdentityClaim, CapabilityEnvelope, } from './resolve-identity.js';
+export type { GraphNode, GraphEdge, GraphResponse, EventType, EdgeType, GapNode, VerificationState, PolicyDocument, PolicyConstraints, EdgeWeights, Modifier, DistributionMethod, CreatorPolicySnapshot, CreatorPolicyEntry, SessionPolicyRecord, Distribution, RecommendationDocument, VerificationResult, } from './types.js';
+export { graphLabelFromEventTypeUri } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAA;AAC7C,YAAY,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAA;AAO3E,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,YAAY,EACV,wBAAwB,EACxB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,oBAAoB,CAAA;AAG3B,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAGzE,OAAO,EACL,kBAAkB,EAClB,6BAA6B,EAC7B,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,qBAAqB,CAAA;AAG5B,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAA;AAG7D,OAAO,EAAE,UAAU,EAAE,wBAAwB,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAA;AAG5F,OAAO,EAAE,uBAAuB,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAC3E,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAGxF,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AACvD,YAAY,EACV,kBAAkB,EAClB,wBAAwB,EACxB,mBAAmB,EACnB,sBAAsB,EACtB,aAAa,EACb,kBAAkB,GACnB,MAAM,uBAAuB,CAAA;AAG9B,YAAY,EACV,SAAS,EACT,SAAS,EACT,aAAa,EACb,SAAS,EACT,QAAQ,EACR,OAAO,EACP,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,WAAW,EACX,QAAQ,EACR,kBAAkB,EAClB,qBAAqB,EACrB,kBAAkB,EAClB,mBAAmB,EACnB,YAAY,EACZ,sBAAsB,EACtB,kBAAkB,GACnB,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,0BAA0B,EAAE,MAAM,YAAY,CAAA"}