@antseed/node 0.2.145 → 0.2.147

package/dist/routing/seller-health.js

@@ -0,0 +1,380 @@
+/**
+ * Adaptive seller selection for automatic routing.
+ *
+ * Each buyer learns, from its own traffic, how every seller serves every
+ * model: how often requests succeed, how soon the answer starts and how fast
+ * it streams. Observations fade with a half-life, so a seller that blipped
+ * once barely moves and a seller that fixed itself recovers as soon as it
+ * serves again — no timers. Trust stays a gate applied before this: every
+ * seller the buyer has not used starts from the same prior, so with no
+ * observations the order is plain price order.
+ *
+ * Sellers are ranked by expected cost of one successful answer: price plus the
+ * value of the time it takes, divided by the chance it succeeds. Traffic is
+ * spread across sellers that are close to the best instead of all going to
+ * one, and a small share probes sellers the buyer has not heard from lately,
+ * so failover always has fresh data and recovered sellers are noticed.
+ *
+ * Nothing here talks to anyone: it is local state plus public metadata.
+ */
+/** Observations lose half their weight every 15 minutes. */
+export const SELLER_HEALTH_HALF_LIFE_MS = 15 * 60_000;
+/** Chance of success assumed for a seller the buyer has not used. */
+export const SELLER_SUCCESS_PRIOR = 0.8;
+/** The prior counts as this many observations. */
+export const SELLER_HEALTH_PRIOR_WEIGHT = 2;
+/** Value of one second of waiting, in USD. Makes a seller 15 s slower worth ~$0.003 more per request. */
+export const DEFAULT_TIME_VALUE_USD_PER_SECOND = 0.0002;
+/** Sellers within this fraction of the best expected cost share the traffic. */
+export const SELLER_SPREAD_TOLERANCE = 0.3;
+/** Share of requests that probe a seller the buyer has no recent data on. */
+export const SELLER_EXPLORATION_RATE = 0.05;
+/** A seller not observed for this long is due for a probe. */
+export const SELLER_STALE_AFTER_MS = 10 * 60_000;
+/**
+ * Extra wait counted for a seller the buyer has no open payment channel with:
+ * the first request has to reserve funds on-chain before it is served.
+ */
+export const NEW_RESERVE_SECONDS = 5;
+/** Below this chance of success a seller is tried only after every healthier one. */
+export const UNHEALTHY_SUCCESS_PROBABILITY = 0.5;
+/** Weight of a seller's record on its other models, for a model with no data of its own. */
+const SELLER_WIDE_WEIGHT = 0.5;
+const DEFAULT_FIRST_TOKEN_MS = 4_000;
+const DEFAULT_TOKENS_PER_SECOND = 50;
+const LATENCY_EMA_ALPHA = 0.3;
+const MIN_THROUGHPUT_TOKENS = 20;
+const MAX_ENTRIES = 2_048;
+/** Entries not observed for a day carry no weight worth keeping. */
+const RETENTION_MS = 24 * 60 * 60_000;
+function emptyStats(now) {
+    return {
+        successes: 0,
+        failures: 0,
+        decayedAt: now,
+        firstTokenMs: null,
+        tokensPerSecond: null,
+        lastSuccessAt: 0,
+        lastFailureAt: 0,
+        lastFailureReason: null,
+    };
+}
+function ema(previous, sample) {
+    return previous === null ? sample : previous * (1 - LATENCY_EMA_ALPHA) + sample * LATENCY_EMA_ALPHA;
+}
+function finiteNonNegative(value) {
+    return typeof value === 'number' && Number.isFinite(value) && value >= 0;
+}
+export function sellerHealthKey(peerId, serviceId) {
+    return `${peerId.trim().toLowerCase().replace(/^0x/, '')}|${(serviceId ?? '').trim().toLowerCase()}`;
+}
+/** What one buyer has observed of every seller and model it used. */
+export class SellerHealthBook {
+    _halfLifeMs;
+    _entries = new Map();
+    constructor(_halfLifeMs = SELLER_HEALTH_HALF_LIFE_MS) {
+        this._halfLifeMs = _halfLifeMs;
+    }
+    _decayed(stats, now) {
+        const elapsed = now - stats.decayedAt;
+        if (elapsed <= 0)
+            return stats;
+        const factor = 0.5 ** (elapsed / this._halfLifeMs);
+        return { ...stats, successes: stats.successes * factor, failures: stats.failures * factor, decayedAt: now };
+    }
+    _update(peerId, serviceId, now, apply) {
+        const key = sellerHealthKey(peerId, serviceId);
+        const current = this._entries.get(key);
+        this._entries.delete(key);
+        this._entries.set(key, apply(current ? this._decayed(current, now) : emptyStats(now)));
+        if (this._entries.size > MAX_ENTRIES) {
+            const oldest = this._entries.keys().next().value;
+            if (oldest !== undefined)
+                this._entries.delete(oldest);
+        }
+    }
+    recordSuccess(peerId, serviceId, now, timing) {
+        this._update(peerId, serviceId, now, (stats) => {
+            const next = { ...stats, successes: stats.successes + 1, lastSuccessAt: now };
+            if (!timing || !finiteNonNegative(timing.firstTokenMs))
+                return next;
+            const outputTokens = timing.outputTokens ?? 0;
+            if (timing.streamed) {
+                next.firstTokenMs = ema(stats.firstTokenMs, timing.firstTokenMs);
+                if (outputTokens >= MIN_THROUGHPUT_TOKENS && finiteNonNegative(timing.streamMs) && timing.streamMs > 0) {
+                    next.tokensPerSecond = ema(stats.tokensPerSecond, outputTokens / (timing.streamMs / 1000));
+                }
+            }
+            else {
+                // Only the whole duration is known: take out the generation time at
+                // the speed seen so far to estimate when the answer would have started.
+                const tokensPerSecond = stats.tokensPerSecond ?? DEFAULT_TOKENS_PER_SECOND;
+                next.firstTokenMs = ema(stats.firstTokenMs, Math.max(0, timing.firstTokenMs - (outputTokens / tokensPerSecond) * 1000));
+            }
+            return next;
+        });
+    }
+    /** `weight` lets a failure that can only be the seller's (a forged receipt) count for more than one. */
+    recordFailure(peerId, serviceId, now, reason, weight = 1) {
+        this._update(peerId, serviceId, now, (stats) => ({
+            ...stats,
+            failures: stats.failures + Math.max(0, weight),
+            lastFailureAt: now,
+            lastFailureReason: reason,
+        }));
+    }
+    /** A failure that applies to every model the seller serves (e.g. a forged receipt) when the model is unknown. */
+    recordSellerFailure(peerId, now, reason, weight = 1) {
+        const prefix = sellerHealthKey(peerId, null);
+        let matched = false;
+        for (const key of [...this._entries.keys()]) {
+            if (!key.startsWith(prefix))
+                continue;
+            const [, serviceId] = key.split('|');
+            this.recordFailure(peerId, serviceId ?? null, now, reason, weight);
+            matched = true;
+        }
+        if (!matched)
+            this.recordFailure(peerId, null, now, reason, weight);
+    }
+    /**
+     * Decayed view of one seller's model. For a model the buyer has not used
+     * with this seller yet, what it saw on the seller's other models counts at
+     * half weight: a seller rejecting every request on one model usually does
+     * on the next. Speed is per model and is not carried over.
+     */
+    stats(peerId, serviceId, now) {
+        const exact = this._entries.get(sellerHealthKey(peerId, serviceId));
+        if (exact)
+            return this._decayed(exact, now);
+        const prefix = sellerHealthKey(peerId, null);
+        let sellerWide = null;
+        for (const [key, entry] of this._entries) {
+            if (!key.startsWith(prefix))
+                continue;
+            const decayed = this._decayed(entry, now);
+            sellerWide ??= { ...emptyStats(now) };
+            sellerWide.successes += decayed.successes * SELLER_WIDE_WEIGHT;
+            sellerWide.failures += decayed.failures * SELLER_WIDE_WEIGHT;
+            if (decayed.lastSuccessAt > sellerWide.lastSuccessAt)
+                sellerWide.lastSuccessAt = decayed.lastSuccessAt;
+            if (decayed.lastFailureAt > sellerWide.lastFailureAt) {
+                sellerWide.lastFailureAt = decayed.lastFailureAt;
+                sellerWide.lastFailureReason = decayed.lastFailureReason;
+            }
+        }
+        return sellerWide;
+    }
+    entries(now) {
+        return [...this._entries.entries()].map(([key, stats]) => {
+            const [peerId, serviceId] = key.split('|');
+            return { peerId: peerId, serviceId: serviceId || null, stats: this._decayed(stats, now) };
+        });
+    }
+    /** Forget a seller entirely, e.g. when an operator asks to give it another chance. */
+    forget(peerId) {
+        const prefix = sellerHealthKey(peerId, null);
+        for (const key of [...this._entries.keys()])
+            if (key.startsWith(prefix))
+                this._entries.delete(key);
+    }
+    serialize(now) {
+        return [...this._entries.entries()]
+            .filter(([, stats]) => now - Math.max(stats.lastSuccessAt, stats.lastFailureAt) < RETENTION_MS)
+            .map(([key, stats]) => [key, this._decayed(stats, now)]);
+    }
+    /** Restore persisted entries, dropping anything malformed or from the future. */
+    static parse(raw, now, halfLifeMs = SELLER_HEALTH_HALF_LIFE_MS) {
+        const book = new SellerHealthBook(halfLifeMs);
+        if (!Array.isArray(raw))
+            return book;
+        for (const item of raw.slice(-MAX_ENTRIES)) {
+            if (!Array.isArray(item) || typeof item[0] !== 'string' || !item[0].includes('|'))
+                continue;
+            const value = item[1];
+            if (!value || typeof value !== 'object')
+                continue;
+            const decayedAt = finiteNonNegative(value.decayedAt) ? Math.min(value.decayedAt, now) : now;
+            const lastSuccessAt = finiteNonNegative(value.lastSuccessAt) ? Math.min(value.lastSuccessAt, now) : 0;
+            const lastFailureAt = finiteNonNegative(value.lastFailureAt) ? Math.min(value.lastFailureAt, now) : 0;
+            if (now - Math.max(lastSuccessAt, lastFailureAt) >= RETENTION_MS)
+                continue;
+            book._entries.set(item[0], {
+                successes: finiteNonNegative(value.successes) ? Math.min(value.successes, 1e6) : 0,
+                failures: finiteNonNegative(value.failures) ? Math.min(value.failures, 1e6) : 0,
+                decayedAt,
+                firstTokenMs: finiteNonNegative(value.firstTokenMs) ? value.firstTokenMs : null,
+                tokensPerSecond: finiteNonNegative(value.tokensPerSecond) && value.tokensPerSecond > 0 ? value.tokensPerSecond : null,
+                lastSuccessAt,
+                lastFailureAt,
+                lastFailureReason: typeof value.lastFailureReason === 'string' ? value.lastFailureReason.slice(0, 200) : null,
+            });
+        }
+        return book;
+    }
+}
+export function successProbability(stats, prior = SELLER_SUCCESS_PRIOR) {
+    const successes = stats?.successes ?? 0;
+    const failures = stats?.failures ?? 0;
+    return (successes + SELLER_HEALTH_PRIOR_WEIGHT * prior) / (successes + failures + SELLER_HEALTH_PRIOR_WEIGHT);
+}
+function median(values) {
+    if (values.length === 0)
+        return null;
+    const sorted = [...values].sort((a, b) => a - b);
+    const middle = Math.floor(sorted.length / 2);
+    return sorted.length % 2 ? sorted[middle] : (sorted[middle - 1] + sorted[middle]) / 2;
+}
+/** Typical speed among sellers the buyer has measured, used for sellers it has not. */
+export function networkSpeed(stats) {
+    return {
+        firstTokenMs: median(stats.flatMap((entry) => entry?.firstTokenMs != null ? [entry.firstTokenMs] : [])) ?? DEFAULT_FIRST_TOKEN_MS,
+        tokensPerSecond: median(stats.flatMap((entry) => entry?.tokensPerSecond != null ? [entry.tokensPerSecond] : [])) ?? DEFAULT_TOKENS_PER_SECOND,
+    };
+}
+export function scoreAdaptiveRoute(input, stats, shape, network, now, timeValueUsdPerSecond = DEFAULT_TIME_VALUE_USD_PER_SECOND) {
+    const probability = successProbability(stats);
+    const firstTokenMs = stats?.firstTokenMs ?? network.firstTokenMs;
+    const tokensPerSecond = stats?.tokensPerSecond ?? network.tokensPerSecond;
+    const expectedSeconds = firstTokenMs / 1000 + shape.outputTokens / Math.max(1, tokensPerSecond)
+        + (input.channelOpen === false ? NEW_RESERVE_SECONDS : 0);
+    const expectedPriceUsd = finiteNonNegative(input.requestUsd)
+        ? input.requestUsd
+        : input.inputUsdPerMillion !== null && input.outputUsdPerMillion !== null
+            ? (shape.inputTokens * input.inputUsdPerMillion + shape.outputTokens * input.outputUsdPerMillion) / 1_000_000
+            : null;
+    // Sellers with no advertised price rank after priced ones (see the ordering);
+    // among themselves, count them at a dollar per million tokens.
+    const pricePart = expectedPriceUsd ?? (shape.inputTokens + shape.outputTokens) / 1_000_000;
+    const lastObservedAt = Math.max(stats?.lastSuccessAt ?? 0, stats?.lastFailureAt ?? 0);
+    return {
+        successProbability: probability,
+        expectedSeconds,
+        expectedPriceUsd,
+        score: (pricePart + timeValueUsdPerSecond * expectedSeconds) / Math.max(probability, 0.01),
+        unhealthy: probability < UNHEALTHY_SUCCESS_PROBABILITY,
+        stale: now - lastObservedAt >= SELLER_STALE_AFTER_MS,
+        stats,
+    };
+}
+/**
+ * Order candidates for one request. Ready, healthy sellers come first: one is
+ * drawn from those within `spreadTolerance` of the best expected cost,
+ * weighted toward the cheapest; the rest follow by expected cost. Unhealthy
+ * sellers follow, then sellers cooling down. With `explorationRate`, a seller
+ * the buyer has no recent data on goes first instead, with the usual order
+ * behind it as the fallback.
+ */
+export function orderAdaptiveRoutes(candidates, input, book, shape, options) {
+    const { now } = options;
+    const random = options.random ?? Math.random;
+    const tolerance = options.spreadTolerance ?? SELLER_SPREAD_TOLERANCE;
+    const explorationRate = options.explorationRate ?? SELLER_EXPLORATION_RATE;
+    const inputs = new Map(candidates.map((candidate) => [candidate, input(candidate)]));
+    const stats = new Map(candidates.map((candidate) => {
+        const { peerId, serviceId } = inputs.get(candidate);
+        return [candidate, book.stats(peerId, serviceId, now)];
+    }));
+    const network = networkSpeed([...stats.values()]);
+    const scores = new Map(candidates.map((candidate) => [
+        candidate,
+        scoreAdaptiveRoute(inputs.get(candidate), stats.get(candidate), shape, network, now, options.timeValueUsdPerSecond),
+    ]));
+    // Priced sellers first, then by expected cost; ties keep the incoming order.
+    const position = new Map(candidates.map((candidate, index) => [candidate, index]));
+    const byScore = (a, b) => Number(scores.get(a).expectedPriceUsd === null) - Number(scores.get(b).expectedPriceUsd === null)
+        || scores.get(a).score - scores.get(b).score
+        || position.get(a) - position.get(b);
+    const cooling = candidates.filter((candidate) => inputs.get(candidate).coolingDown).sort(byScore);
+    const ready = candidates.filter((candidate) => !inputs.get(candidate).coolingDown);
+    const saturated = (candidate) => inputs.get(candidate).saturated === true;
+    const healthy = ready.filter((candidate) => !scores.get(candidate).unhealthy)
+        .sort((a, b) => Number(saturated(a)) - Number(saturated(b)) || byScore(a, b));
+    const unhealthy = ready.filter((candidate) => scores.get(candidate).unhealthy).sort(byScore);
+    const leader = healthy[0];
+    const best = leader ? scores.get(leader).score : null;
+    const leaderPriced = leader ? scores.get(leader).expectedPriceUsd !== null : false;
+    let pool = best === null ? [] : healthy.filter((candidate) => scores.get(candidate).score <= best * (1 + tolerance)
+        && (scores.get(candidate).expectedPriceUsd !== null) === leaderPriced
+        && saturated(candidate) === saturated(leader));
+    // Spreading must not open payment channels for its own sake: share traffic
+    // among sellers the buyer already pays, and only reserve on a new seller
+    // when it is the best choice outright (or failover needs it).
+    const channelOpen = (candidate) => inputs.get(candidate).channelOpen;
+    if (pool.some((candidate) => channelOpen(candidate) === false)) {
+        const open = pool.filter((candidate) => channelOpen(candidate) !== false);
+        pool = open.length > 0 ? open : pool.slice(0, 1);
+    }
+    let ordered = [...healthy, ...unhealthy, ...cooling];
+    if (pool.length > 0) {
+        // Weight 1/score²: twice as expensive gets a quarter of the traffic. The
+        // pool may no longer hold the leader (it needed a new channel), so even a
+        // single remaining seller goes first.
+        const weights = pool.map((candidate) => 1 / Math.max(scores.get(candidate).score, 1e-9) ** 2);
+        const picked = pool.length === 1
+            ? pool[0]
+            : options.affinityKey
+                ? rendezvousPick(pool, weights, (candidate) => inputs.get(candidate).peerId, options.affinityKey)
+                : weightedPick(pool, weights, random());
+        ordered = [picked, ...ordered.filter((candidate) => candidate !== picked)];
+    }
+    let explored = null;
+    // Probes are separate requests, never a turn of an ongoing conversation
+    // (that would move it off its cached seller), never open a channel, and
+    // never go to a seller already at its concurrency limit.
+    if (pool.length > 0 && !options.affinityKey && explorationRate > 0 && random() < explorationRate) {
+        explored = ready.filter((candidate) => !pool.includes(candidate) && scores.get(candidate).stale
+            && channelOpen(candidate) !== false && !saturated(candidate)).sort(byScore)[0] ?? null;
+        if (explored)
+            ordered = [explored, ...ordered.filter((candidate) => candidate !== explored)];
+    }
+    return { ordered, scores, pool, explored };
+}
+function weightedPick(pool, weights, draw) {
+    let remaining = draw * weights.reduce((sum, weight) => sum + weight, 0);
+    for (const [index, weight] of weights.entries()) {
+        remaining -= weight;
+        if (remaining < 0)
+            return pool[index];
+    }
+    return pool[pool.length - 1];
+}
+/** FNV-1a over the key and seller, mapped to (0, 1]. */
+function stableUnit(text) {
+    let hash = 0x811c9dc5;
+    for (let index = 0; index < text.length; index += 1) {
+        hash ^= text.charCodeAt(index);
+        hash = Math.imul(hash, 0x01000193) >>> 0;
+    }
+    return (hash + 1) / 0x1_0000_0001;
+}
+/**
+ * Weighted rendezvous hashing: each conversation maps to one seller, with
+ * sellers' shares proportional to their weights. When the pool changes, only
+ * the conversations of a seller that left (or the share a newcomer takes)
+ * move; everyone else stays where their cache is.
+ */
+function rendezvousPick(pool, weights, peerId, key) {
+    let best = pool[0];
+    let bestScore = Number.NEGATIVE_INFINITY;
+    for (const [index, candidate] of pool.entries()) {
+        const score = Math.log(stableUnit(`${key}|${peerId(candidate)}`)) / weights[index];
+        if (score > bestScore) {
+            bestScore = score;
+            best = candidate;
+        }
+    }
+    return best;
+}
+/**
+ * How long to wait for a seller to start answering before trying the next
+ * one: four times what it usually takes, never under 30 s or over 2 min.
+ * Null when the buyer has too little data on the seller to judge.
+ */
+export function adaptiveFirstTokenTimeoutMs(stats, expectedOutputTokens, streamed) {
+    if (!stats || stats.firstTokenMs === null || stats.successes < 2)
+        return null;
+    const generationMs = streamed ? 0 : (expectedOutputTokens / (stats.tokensPerSecond ?? DEFAULT_TOKENS_PER_SECOND)) * 1000;
+    return Math.round(Math.min(120_000, Math.max(30_000, 4 * (stats.firstTokenMs + generationMs))));
+}
+//# sourceMappingURL=seller-health.js.map

package/dist/routing/seller-health.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"seller-health.js","sourceRoot":"","sources":["../../src/routing/seller-health.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,4DAA4D;AAC5D,MAAM,CAAC,MAAM,0BAA0B,GAAG,EAAE,GAAG,MAAM,CAAA;AACrD,qEAAqE;AACrE,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAA;AACvC,kDAAkD;AAClD,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAA;AAC3C,yGAAyG;AACzG,MAAM,CAAC,MAAM,iCAAiC,GAAG,MAAM,CAAA;AACvD,gFAAgF;AAChF,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAA;AAC1C,6EAA6E;AAC7E,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAA;AAC3C,8DAA8D;AAC9D,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,GAAG,MAAM,CAAA;AAChD;;;GAGG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAA;AACpC,qFAAqF;AACrF,MAAM,CAAC,MAAM,6BAA6B,GAAG,GAAG,CAAA;AAEhD,4FAA4F;AAC5F,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAC9B,MAAM,sBAAsB,GAAG,KAAK,CAAA;AACpC,MAAM,yBAAyB,GAAG,EAAE,CAAA;AACpC,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAC7B,MAAM,qBAAqB,GAAG,EAAE,CAAA;AAChC,MAAM,WAAW,GAAG,KAAK,CAAA;AACzB,oEAAoE;AACpE,MAAM,YAAY,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAA;AA2BrC,SAAS,UAAU,CAAC,GAAW;IAC7B,OAAO;QACL,SAAS,EAAE,CAAC;QACZ,QAAQ,EAAE,CAAC;QACX,SAAS,EAAE,GAAG;QACd,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,CAAC;QAChB,aAAa,EAAE,CAAC;QAChB,iBAAiB,EAAE,IAAI;KACxB,CAAA;AACH,CAAC;AAED,SAAS,GAAG,CAAC,QAAuB,EAAE,MAAc;IAClD,OAAO,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,GAAG,MAAM,GAAG,iBAAiB,CAAA;AACrG,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAc;IACvC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;AAC1E,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,SAAoC;IAClF,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAA;AACtG,CAAC;AAED,qEAAqE;AACrE,MAAM,OAAO,gBAAgB;IAGE;IAFZ,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAA;IAEhE,YAA6B,cAAc,0BAA0B;QAAxC,gBAAW,GAAX,WAAW,CAA6B;IAAG,CAAC;IAEjE,QAAQ,CAAC,KAAwB,EAAE,GAAW;QACpD,MAAM,OAAO,GAAG,GAAG,GAAG,KAAK,CAAC,SAAS,CAAA;QACrC,IAAI,OAAO,IAAI,CAAC;YAAE,OAAO,KAAK,CAAA;QAC9B,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,CAAA;QAClD,OAAO,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,GAAG,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAA;IAC7G,CAAC;IAEO,OAAO,CAAC,MAAc,EAAE,SAAwB,EAAE,GAAW,EAAE,KAAsD;QAC3H,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACtC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACtF,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;YAChD,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;IAED,aAAa,CAAC,MAAc,EAAE,SAAwB,EAAE,GAAW,EAAE,MAA4B;QAC/F,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE;YAC7C,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,CAAA;YAC7E,IAAI,CAAC,MAAM,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,YAAY,CAAC;gBAAE,OAAO,IAAI,CAAA;YACnE,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,CAAC,CAAA;YAC7C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpB,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,MAAM,CAAC,YAAY,CAAC,CAAA;gBAChE,IAAI,YAAY,IAAI,qBAAqB,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACvG,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC,KAAK,CAAC,eAAe,EAAE,YAAY,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAA;gBAC5F,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,oEAAoE;gBACpE,wEAAwE;gBACxE,MAAM,eAAe,GAAG,KAAK,CAAC,eAAe,IAAI,yBAAyB,CAAA;gBAC1E,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,YAAY,GAAG,CAAC,YAAY,GAAG,eAAe,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;YACzH,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,wGAAwG;IACxG,aAAa,CAAC,MAAc,EAAE,SAAwB,EAAE,GAAW,EAAE,MAAc,EAAE,MAAM,GAAG,CAAC;QAC7F,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC/C,GAAG,KAAK;YACR,QAAQ,EAAE,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC;YAC9C,aAAa,EAAE,GAAG;YAClB,iBAAiB,EAAE,MAAM;SAC1B,CAAC,CAAC,CAAA;IACL,CAAC;IAED,iHAAiH;IACjH,mBAAmB,CAAC,MAAc,EAAE,GAAW,EAAE,MAAc,EAAE,MAAM,GAAG,CAAC;QACzE,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAC5C,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,SAAQ;YACrC,MAAM,CAAC,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACpC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,SAAS,IAAI,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;YAClE,OAAO,GAAG,IAAI,CAAA;QAChB,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;IACrE,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAc,EAAE,SAAwB,EAAE,GAAW;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAA;QACnE,IAAI,KAAK;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC3C,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAC5C,IAAI,UAAU,GAA6B,IAAI,CAAA;QAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,SAAQ;YACrC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YACzC,UAAU,KAAK,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAA;YACrC,UAAU,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,GAAG,kBAAkB,CAAA;YAC9D,UAAU,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,GAAG,kBAAkB,CAAA;YAC5D,IAAI,OAAO,CAAC,aAAa,GAAG,UAAU,CAAC,aAAa;gBAAE,UAAU,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAA;YACtG,IAAI,OAAO,CAAC,aAAa,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;gBACrD,UAAU,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAA;gBAChD,UAAU,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAA;YAC1D,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAA;IACnB,CAAC;IAED,OAAO,CAAC,GAAW;QACjB,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;YACvD,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC1C,OAAO,EAAE,MAAM,EAAE,MAAO,EAAE,SAAS,EAAE,SAAS,IAAI,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAA;QAC5F,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,sFAAsF;IACtF,MAAM,CAAC,MAAc;QACnB,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAAE,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACpG,CAAC;IAED,SAAS,CAAC,GAAW;QACnB,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;aAChC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,GAAG,YAAY,CAAC;aAC9F,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,iFAAiF;IACjF,MAAM,CAAC,KAAK,CAAC,GAAY,EAAE,GAAW,EAAE,UAAU,GAAG,0BAA0B;QAC7E,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,UAAU,CAAC,CAAA;QAC7C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAA;QACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAQ;YAC3F,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAsC,CAAA;YAC1D,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,SAAQ;YACjD,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;YAC3F,MAAM,aAAa,GAAG,iBAAiB,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACrG,MAAM,aAAa,GAAG,iBAAiB,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACrG,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,YAAY;gBAAE,SAAQ;YAC1E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACzB,SAAS,EAAE,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClF,QAAQ,EAAE,iBAAiB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/E,SAAS;gBACT,YAAY,EAAE,iBAAiB,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI;gBAC/E,eAAe,EAAE,iBAAiB,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI;gBACrH,aAAa;gBACb,aAAa;gBACb,iBAAiB,EAAE,OAAO,KAAK,CAAC,iBAAiB,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI;aAC9G,CAAC,CAAA;QACJ,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;CACF;AAED,MAAM,UAAU,kBAAkB,CAAC,KAA+B,EAAE,KAAK,GAAG,oBAAoB;IAC9F,MAAM,SAAS,GAAG,KAAK,EAAE,SAAS,IAAI,CAAC,CAAA;IACvC,MAAM,QAAQ,GAAG,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAA;IACrC,OAAO,CAAC,SAAS,GAAG,0BAA0B,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,GAAG,0BAA0B,CAAC,CAAA;AAC/G,CAAC;AAyCD,SAAS,MAAM,CAAC,MAAgB;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACpC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC5C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,MAAM,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,CAAA;AAC1F,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,YAAY,CAAC,KAAsC;IACjE,OAAO;QACL,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,sBAAsB;QACjI,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,yBAAyB;KAC9I,CAAA;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,KAAyB,EACzB,KAA+B,EAC/B,KAAwB,EACxB,OAAqB,EACrB,GAAW,EACX,qBAAqB,GAAG,iCAAiC;IAEzD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAC7C,MAAM,YAAY,GAAG,KAAK,EAAE,YAAY,IAAI,OAAO,CAAC,YAAY,CAAA;IAChE,MAAM,eAAe,GAAG,KAAK,EAAE,eAAe,IAAI,OAAO,CAAC,eAAe,CAAA;IACzE,MAAM,eAAe,GAAG,YAAY,GAAG,IAAI,GAAG,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC;UAC3F,CAAC,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3D,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,KAAK,CAAC,UAAU,CAAC;QAC1D,CAAC,CAAC,KAAK,CAAC,UAAU;QAClB,CAAC,CAAC,KAAK,CAAC,kBAAkB,KAAK,IAAI,IAAI,KAAK,CAAC,mBAAmB,KAAK,IAAI;YACvE,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,kBAAkB,GAAG,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,mBAAmB,CAAC,GAAG,SAAS;YAC7G,CAAC,CAAC,IAAI,CAAA;IACV,8EAA8E;IAC9E,+DAA+D;IAC/D,MAAM,SAAS,GAAG,gBAAgB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,SAAS,CAAA;IAC1F,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,IAAI,CAAC,EAAE,KAAK,EAAE,aAAa,IAAI,CAAC,CAAC,CAAA;IACrF,OAAO;QACL,kBAAkB,EAAE,WAAW;QAC/B,eAAe;QACf,gBAAgB;QAChB,KAAK,EAAE,CAAC,SAAS,GAAG,qBAAqB,GAAG,eAAe,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC;QAC1F,SAAS,EAAE,WAAW,GAAG,6BAA6B;QACtD,KAAK,EAAE,GAAG,GAAG,cAAc,IAAI,qBAAqB;QACpD,KAAK;KACN,CAAA;AACH,CAAC;AA0BD;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAAe,EACf,KAA2C,EAC3C,IAAsB,EACtB,KAAwB,EACxB,OAA6B;IAE7B,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAA;IACvB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAA;IAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,eAAe,IAAI,uBAAuB,CAAA;IACpE,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,uBAAuB,CAAA;IAC1E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IACpF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QACjD,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAA;QACpD,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,CAAA;IACxD,CAAC,CAAC,CAAC,CAAA;IACH,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC;QACnD,SAAS;QACT,kBAAkB,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,SAAS,CAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,qBAAqB,CAAC;KACtH,CAAC,CAAC,CAAA;IAEH,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;IAClF,MAAM,OAAO,GAAG,CAAC,CAAI,EAAE,CAAI,EAAU,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,gBAAgB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,gBAAgB,KAAK,IAAI,CAAC;WACtI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK;WAC3C,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;IACxC,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAClG,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,WAAW,CAAC,CAAA;IACnF,MAAM,SAAS,GAAG,CAAC,SAAY,EAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,SAAS,KAAK,IAAI,CAAA;IACtF,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,SAAS,CAAC;SAC3E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC/E,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAE7F,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACzB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;IACtD,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,gBAAgB,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAA;IACnF,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;WAC/G,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,gBAAgB,KAAK,IAAI,CAAC,KAAK,YAAY;WACnE,SAAS,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC,MAAO,CAAC,CAAC,CAAA;IACjD,2EAA2E;IAC3E,yEAAyE;IACzE,8DAA8D;IAC9D,MAAM,WAAW,GAAG,CAAC,SAAY,EAAuB,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,WAAW,CAAA;IAC7F,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,KAAK,CAAC,CAAA;QACzE,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAClD,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC,CAAA;IACpD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,yEAAyE;QACzE,0EAA0E;QAC1E,sCAAsC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QAC9F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE;YACV,CAAC,CAAC,OAAO,CAAC,WAAW;gBACnB,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC;gBAClG,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAA;QAC3C,OAAO,GAAG,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAA;IAC5E,CAAC;IAED,IAAI,QAAQ,GAAa,IAAI,CAAA;IAC7B,wEAAwE;IACxE,wEAAwE;IACxE,yDAAyD;IACzD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,eAAe,GAAG,CAAC,IAAI,MAAM,EAAE,GAAG,eAAe,EAAE,CAAC;QACjG,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,KAAK;eAC3F,WAAW,CAAC,SAAS,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;QACxF,IAAI,QAAQ;YAAE,OAAO,GAAG,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAA;IAC9F,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC5C,CAAC;AAED,SAAS,YAAY,CAAI,IAAS,EAAE,OAAiB,EAAE,IAAY;IACjE,IAAI,SAAS,GAAG,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,EAAE,CAAC,CAAC,CAAA;IACvE,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QAChD,SAAS,IAAI,MAAM,CAAA;QACnB,IAAI,SAAS,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAE,CAAA;IACxC,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;AAC/B,CAAC;AAED,wDAAwD;AACxD,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,IAAI,GAAG,UAAU,CAAA;IACrB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACpD,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QAC9B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IAC1C,CAAC;IACD,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,CAAA;AACnC,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAI,IAAS,EAAE,OAAiB,EAAE,MAAgC,EAAE,GAAW;IACpG,IAAI,IAAI,GAAM,IAAI,CAAC,CAAC,CAAE,CAAA;IACtB,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAA;IACxC,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAE,CAAA;QACnF,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAAC,SAAS,GAAG,KAAK,CAAC;YAAC,IAAI,GAAG,SAAS,CAAA;QAAC,CAAC;IAChE,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CAAC,KAA+B,EAAE,oBAA4B,EAAE,QAAiB;IAC1H,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,YAAY,KAAK,IAAI,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAC7E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB,GAAG,CAAC,KAAK,CAAC,eAAe,IAAI,yBAAyB,CAAC,CAAC,GAAG,IAAI,CAAA;IACxH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;AACjG,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@antseed/node",
-  "version": "0.2.145",
+  "version": "0.2.147",
   "description": "Antseed Network protocol SDK — P2P inference marketplace",
   "type": "module",
   "files": [
@@ -70,8 +70,8 @@
     "node-datachannel": "^0.7.0",
     "tokenx": "^1.3.0",
     "@antseed/api-adapter": "0.1.53",
-    "@antseed/buyer-core": "0.1.22",
-    "@antseed/protocol": "0.1.10"
+    "@antseed/protocol": "0.1.10",
+    "@antseed/buyer-core": "0.1.23"
   },
   "optionalDependencies": {
     "keytar": "^7.9.0"