@srouterhq/server 0.0.0-stage → 0.9.0

package/dist/services/scoring.js

@@ -0,0 +1,435 @@
+// ── Bandit routing score ────────────────────────────────────────────────────
+//
+// A redesign of the analytics-driven router. Instead of summing a pile of
+// hand-tuned, dimensionally-incompatible bonuses (a probability + a raw latency
+// term + an intelligence term, each hand-capped to keep orderings sane), every
+// signal here is normalized to [0, 1] and combined as a CONVEX COMBINATION:
+//
+//   base = w_rel·reliability + w_speed·speed + w_intel·intelligence
+//          (weights are a preset that sums to 1, so base ∈ [0, 1])
+//
+// Two always-on GUARDRAILS then multiply the base — they never reorder good
+// models against each other, they only pull a model down as it gets dangerous:
+//
+//   effective = base × headroomFactor × rateLimitFactor
+//
+//   headroomFactor  → protects a model that is nearly out of its free quota
+//   rateLimitFactor → demotes a model that is currently throwing 429s
+//
+// Reliability is drawn from a Beta posterior (Thompson sampling) so exploration
+// is automatic and proportional to uncertainty — a model is never permanently
+// frozen out after a couple of failures. Speed and intelligence are
+// deterministic. The result stays in a bounded, interpretable range and no term
+// needs a manual cap to "still beat a 0%-success model".
+export const BANDIT_PRESETS = {
+    // Reliability leads; speed and intelligence split the rest evenly.
+    balanced: { reliability: 0.5, speed: 0.25, intelligence: 0.25 },
+    // Intelligence leads, but reliability still carries real weight so a smart
+    // model that keeps failing doesn't win.
+    smartest: { reliability: 0.35, speed: 0.1, intelligence: 0.55 },
+    // Speed leads; reliability keeps a fast-but-broken model from winning.
+    fastest: { reliability: 0.35, speed: 0.55, intelligence: 0.1 },
+    // Reliability dominates — for clients that just want it to work.
+    reliable: { reliability: 0.7, speed: 0.15, intelligence: 0.15 },
+};
+// Analytics-driven routing is on by default ('balanced'). Operators who want the
+// old hand-ordered chain can switch the strategy to 'priority' from the
+// dashboard or PUT /api/fallback/routing.
+export const DEFAULT_STRATEGY = 'balanced';
+export const DEFAULT_PEAK_START_HOUR = 18;
+export const DEFAULT_PEAK_END_HOUR = 6; // default window spans midnight: [18, 24) ∪ [0, 6)
+export const DEFAULT_PEAK_TIMEZONE = 'UTC';
+/** Fraction of the speed weight moved onto reliability during peak hours. */
+export const PEAK_SPEED_TO_RELIABILITY = 0.6;
+export const DEFAULT_PEAK_HOURS = {
+    enabled: false,
+    startHour: DEFAULT_PEAK_START_HOUR,
+    endHour: DEFAULT_PEAK_END_HOUR,
+    timezone: DEFAULT_PEAK_TIMEZONE,
+};
+/**
+ * Presets exempt from the peak adjustment.
+ *
+ * `fastest` and `reliable` are the two ends of the speed↔reliability axis, and
+ * they are what an operator picks when they have already decided which end they
+ * want. Shifting 60% of `fastest`'s 0.55 speed weight would leave it at
+ * reliability 0.68 / speed 0.22 — i.e. `fastest` would quietly become a slightly
+ * noisy copy of `reliable`, which is a different preset the user could have
+ * selected. `reliable` is exempt for the mirror-image reason: it is already the
+ * reliability extreme, so there is nothing the adjustment can add, and moving
+ * its speed weight only pushes it past the range any preset offers. The
+ * adjustment therefore applies only to the mixed presets (`balanced`,
+ * `smartest`), where trading some speed weight for reliability stays inside the
+ * span the presets already describe. Clamping instead of exempting was the
+ * alternative; exempting is chosen because it keeps each preset's identity
+ * exactly, rather than making two of them silently converge on a third.
+ */
+export const PEAK_EXEMPT_STRATEGIES = ['fastest', 'reliable'];
+/** Whether this strategy opts out of the peak adjustment (see above). */
+export function isPeakExemptStrategy(strategy) {
+    return PEAK_EXEMPT_STRATEGIES.includes(strategy);
+}
+/** True when `hour` is a whole number in 0–23. */
+export function isValidPeakHour(hour) {
+    return typeof hour === 'number' && Number.isInteger(hour) && hour >= 0 && hour <= 23;
+}
+/** True when `timezone` is an IANA name this runtime's ICU data knows. */
+export function isValidTimezone(timezone) {
+    if (typeof timezone !== 'string' || !timezone.trim())
+        return false;
+    try {
+        new Intl.DateTimeFormat('en-US', { timeZone: timezone });
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * The hour (0–23) at `now` in `timezone`. Uses Intl rather than Date#getHours
+ * so the window means the same thing regardless of the host's TZ. An unknown
+ * timezone falls back to UTC instead of throwing — routing must never fail
+ * because a settings row went stale.
+ */
+export function hourInTimezone(now, timezone) {
+    const zone = isValidTimezone(timezone) ? timezone : DEFAULT_PEAK_TIMEZONE;
+    const parts = new Intl.DateTimeFormat('en-US', { timeZone: zone, hour: 'numeric', hourCycle: 'h23' })
+        .formatToParts(now);
+    const raw = parts.find(p => p.type === 'hour')?.value ?? '0';
+    const parsed = Number.parseInt(raw, 10);
+    return Number.isFinite(parsed) ? parsed % 24 : 0;
+}
+/**
+ * True when `now` falls inside the configured window. `startHour === endHour`
+ * is an EMPTY window, not a 24-hour one: an operator who drags both ends to the
+ * same value means "nothing", and the alternative (always peak) would be a
+ * permanent silent reweight from a config that looks like a no-op.
+ */
+export function isPeakHours(config, now = new Date()) {
+    if (!config.enabled)
+        return false;
+    if (!isValidPeakHour(config.startHour) || !isValidPeakHour(config.endHour))
+        return false;
+    if (config.startHour === config.endHour)
+        return false;
+    const h = hourInTimezone(now, config.timezone);
+    return config.startHour < config.endHour
+        ? h >= config.startHour && h < config.endHour
+        : h >= config.startHour || h < config.endHour;
+}
+/**
+ * Peak-adjusted weights for a bandit preset, plus whether the adjustment
+ * actually fired (the dashboard labels the weight summary from that flag).
+ * Returns the base vector untouched when the feature is off, when the clock is
+ * outside the window, or when the strategy is exempt.
+ */
+export function peakAdjustedWeights(base, strategy, config, now = new Date()) {
+    if (isPeakExemptStrategy(strategy))
+        return { weights: base, adjusted: false };
+    if (!isPeakHours(config, now))
+        return { weights: base, adjusted: false };
+    const shift = base.speed * PEAK_SPEED_TO_RELIABILITY;
+    if (shift <= 0)
+        return { weights: base, adjusted: false };
+    return {
+        weights: {
+            reliability: base.reliability + shift,
+            speed: base.speed - shift,
+            intelligence: base.intelligence,
+        },
+        adjusted: true,
+    };
+}
+// ── Task-type weight bias (#1127) ─────────────────────────────────────────
+// A coding turn is quality-sensitive, a chat turn is budget/speed-sensitive.
+// When a request declares (or derives) a task type, move part of one axis onto
+// the other — code: speed → intelligence, chat: intelligence → speed. The
+// deltas are deliberately conservative and the whole thing is opt-in: no
+// header (or `auto` with no code signal) leaves the preset weights untouched.
+export const TASK_WEIGHT_SHARE = 0.3;
+/**
+ * Presets exempt from the task-type bias.
+ *
+ * The same reasoning as `PEAK_EXEMPT_STRATEGIES` (see above), plus `custom`:
+ * `fastest` and `reliable` are the ends of the axis an operator picks when they
+ * have already decided which end they want, and rewriting them turns one preset
+ * into a noisy copy of another; `custom` is the operator's hand-set sliders, the
+ * one weight vector they typed themselves, so a per-request header must not move
+ * it. The bias therefore applies only to the mixed presets (`balanced`,
+ * `smartest`). `priority` never reaches here — it has no weight vector at all.
+ */
+export const TASK_EXEMPT_STRATEGIES = [...PEAK_EXEMPT_STRATEGIES, 'custom'];
+/** Whether this strategy opts out of the task-type bias (see above). */
+export function isTaskExemptStrategy(strategy) {
+    return TASK_EXEMPT_STRATEGIES.includes(strategy);
+}
+export function taskAdjustedWeights(base, task, strategy, share = TASK_WEIGHT_SHARE) {
+    if (isTaskExemptStrategy(strategy))
+        return { weights: base, adjusted: false };
+    // share 0 disables the bias entirely — an operator-set value of 0 means "keep
+    // the preset weights for this task type".
+    if (share <= 0)
+        return { weights: base, adjusted: false };
+    if (task === 'code') {
+        const shift = base.speed * share;
+        if (shift <= 0)
+            return { weights: base, adjusted: false };
+        return {
+            weights: {
+                reliability: base.reliability,
+                speed: base.speed - shift,
+                intelligence: base.intelligence + shift,
+            },
+            adjusted: true,
+        };
+    }
+    const shift = base.intelligence * share;
+    if (shift <= 0)
+        return { weights: base, adjusted: false };
+    return {
+        weights: {
+            reliability: base.reliability,
+            speed: base.speed + shift,
+            intelligence: base.intelligence - shift,
+        },
+        adjusted: true,
+    };
+}
+// ── Reliability ───────────────────────────────────────────────────────────
+// Beta(1,1) prior = uniform: an unseen model is genuinely uncertain, not assumed
+// good or bad. With decay-weighted pseudo-counts the alpha/beta are continuous.
+export const PRIOR_SUCCESS = 1;
+export const PRIOR_FAILURE = 1;
+export function reliabilityPosterior(successes, failures, community) {
+    return {
+        alpha: Math.max(0, successes) + (community?.successes ?? 0) + PRIOR_SUCCESS,
+        beta: Math.max(0, failures) + (community?.failures ?? 0) + PRIOR_FAILURE,
+    };
+}
+// Deterministic expected reliability — used for the dashboard display score.
+export function expectedReliability(successes, failures, community) {
+    const { alpha, beta } = reliabilityPosterior(successes, failures, community);
+    return alpha / (alpha + beta);
+}
+// ── Speed (throughput + TTFB blended into one [0,1] axis) ───────────────────
+// Throughput uses a saturating curve so one very fast tiny model can't make a
+// perfectly-fine larger model look "slow" (the global-max-normalization bug in
+// the fork). TTFB is a simple linear ramp from "instant" to "painfully slow".
+export const SPEED_SCALE_TOK_S = 60; // tok/s at which throughput ≈ 0.63
+export const TTFB_BEST_MS = 300; // ≤ this → full latency credit
+export const TTFB_WORST_MS = 5000; // ≥ this → zero latency credit
+const THROUGHPUT_WEIGHT = 0.6; // within the speed axis
+const TTFB_WEIGHT = 0.4;
+// Optimistic prior so unmeasured models still get explored on the speed axis.
+export const SPEED_PRIOR = 0.6;
+function throughputScore(tokPerSec) {
+    if (tokPerSec <= 0)
+        return 0;
+    return 1 - Math.exp(-tokPerSec / SPEED_SCALE_TOK_S);
+}
+function ttfbScore(ttfbMs) {
+    if (ttfbMs <= TTFB_BEST_MS)
+        return 1;
+    if (ttfbMs >= TTFB_WORST_MS)
+        return 0;
+    return 1 - (ttfbMs - TTFB_BEST_MS) / (TTFB_WORST_MS - TTFB_BEST_MS);
+}
+/**
+ * Blend throughput and TTFB into a single [0,1] speed score.
+ * `tokPerSec <= 0` means no successful samples → return the exploration prior.
+ * `ttfbMs === null` means we have throughput but no first-byte timing → fall
+ * back to throughput alone rather than guessing latency.
+ */
+export function speedScore(tokPerSec, ttfbMs) {
+    if (tokPerSec <= 0 && ttfbMs === null)
+        return SPEED_PRIOR;
+    const tp = throughputScore(tokPerSec);
+    if (ttfbMs === null)
+        return tp;
+    if (tokPerSec <= 0)
+        return ttfbScore(ttfbMs);
+    return THROUGHPUT_WEIGHT * tp + TTFB_WEIGHT * ttfbScore(ttfbMs);
+}
+// ── Speed: what a timeout costs (#619) ──────────────────────────────────────
+// A request that times out IS the model being slow — the reporter's exact
+// complaint: a relay model that hangs on half its calls loses reliability but
+// used to keep a pristine speed number, because the analytics query fed the
+// speed axis from `status = 'success'` rows ONLY. So a timeout now contributes
+// to the speed window as what it actually was: its wall-clock latency with ZERO
+// output tokens (dragging throughput down) and that same latency as its
+// first-byte time (which lands past TTFB_WORST_MS, i.e. no latency credit).
+//
+// Capped, because `latency_ms` on a timed-out row is unbounded — a provider
+// that holds a socket open for twenty minutes, or a per-platform
+// PROVIDER_TIMEOUT override in the hundreds of seconds, would otherwise let a
+// single hang dominate the whole 7-day window and flatten the axis for every
+// model on that platform. Two minutes is above the built-in per-attempt HTTP
+// deadline and the 90s stream-stall watchdog, so a normal timeout is counted in
+// full and only genuine outliers are clipped.
+export const TIMEOUT_LATENCY_CAP_MS = 120_000;
+// ── Observed speed rank ─────────────────────────────────────────────────────
+// `models.speed_rank` is the catalog's hand-assigned "how fast is this model"
+// ordering (1 = fastest; the shipped catalog spans 1..11) and it drives the
+// dashboard's sort-by-speed preset. Until now nothing ever wrote it at runtime,
+// so it stayed frozen at whatever the seed said no matter how the model
+// actually behaved (#619). observedSpeedRank projects the live [0,1] speed axis
+// back onto that same low-is-fast scale so an observed rank is directly
+// comparable with a catalog one.
+export const OBSERVED_SPEED_RANK_BEST = 1;
+export const OBSERVED_SPEED_RANK_WORST = 10;
+export function observedSpeedRank(speed) {
+    const s = Math.min(1, Math.max(0, Number.isFinite(speed) ? speed : 0));
+    const span = OBSERVED_SPEED_RANK_WORST - OBSERVED_SPEED_RANK_BEST;
+    return OBSERVED_SPEED_RANK_BEST + Math.round((1 - s) * span);
+}
+// ── Intelligence ────────────────────────────────────────────────────────────
+// `size_label` is the CROSS-PROVIDER capability tier (issue #135 — a seeded
+// intelligence_rank is only calibrated within one provider's own catalog), so
+// tier still dominates and no rank can promote a model past the tier above it.
+// Inside a tier, though, rank is no longer a near-invisible tiebreak: it now
+// has a real, visible effect on the composite ACROSS providers by design, so
+// that a user's rank edit actually moves the axis and the routing order
+// (#673). A label we don't recognize scores below every real tier — it is the
+// FLOOR of this axis, not an exclusion from routing: intelligence is one
+// weighted term in the convex combination below, so an untiered model with
+// strong reliability and speed still wins routes under most presets. Custom
+// models are seeded at the catalog median tier for the same reason
+// (custom-model-seed.ts, #488) — "unknown" is no opinion, not "worst".
+export const TIER_VALUE = { Frontier: 4, Large: 3, Medium: 2, Small: 1 };
+export function tierValue(sizeLabel) {
+    return TIER_VALUE[sizeLabel] ?? 0;
+}
+// Rank is 1..1000 with 1 = best. A LINEAR rank term made the axis effectively
+// blind to user edits (#673): tier*1000 dwarfed the rank, and the chain-level
+// min-max normalization diluted a few-rank-point change to well under a
+// displayed percentage point, so "set the intelligence rank to a better
+// number" looked like it did nothing. Compress the rank with a square root so
+// edits near the top of the range (1 vs 3 vs 10) are visible on the axis and
+// in routing, while the tier keeps strict dominance: the worst rank in a tier
+// (sqrt(1000)*31 ≈ 980 < 1000) still beats the best rank of the tier below.
+const RANK_SCALE = 31;
+export function intelligenceComposite(sizeLabel, intelligenceRank) {
+    // tier*1000 keeps tiers strictly separated; -sqrt(rank)*RANK_SCALE prefers
+    // lower rank in-tier but lets rank edits move the axis (see #673).
+    return tierValue(sizeLabel) * 1000 - Math.sqrt(Math.max(1, intelligenceRank)) * RANK_SCALE;
+}
+// Caller supplies a composite (tier-first, sqrt-compressed rank — see above) and
+// the min/max across the enabled chain. We min-max normalize to [0,1], 1 = best.
+export function intelligenceScore(composite, min, max) {
+    if (max <= min)
+        return 1; // single model or all equal → neutral-high
+    return (composite - min) / (max - min);
+}
+// ── Guardrail: free-quota headroom ──────────────────────────────────────────
+// Multiplier that stays at 1 while a model has comfortable monthly headroom and
+// ramps down to a floor as it approaches its free-tier cap, so we stop steering
+// traffic at a model we're about to burn out. Unknown budget (0) → no opinion.
+// Thresholds are tunable per-instance (#899): callers may pass explicit
+// rampStart/floor, and the defaults below are the historical behavior (start
+// protecting at 20% remaining, floor at 10% of the score). Router wires these
+// to persisted settings so operators can tune without a code change.
+export const HEADROOM_FLOOR = 0.1;
+export const HEADROOM_RAMP_START = 0.2; // start protecting at 20% remaining
+export function headroomFactor(usedTokens, budgetTokens, opts) {
+    if (!budgetTokens || budgetTokens <= 0)
+        return 1; // unknown budget → no opinion
+    return headroomRamp(1 - usedTokens / budgetTokens, opts);
+}
+/** The shared ramp both headroom guardrails ride: 1 while `remaining` (a 0..1
+ *  fraction of the quota still available) is comfortable, then linear down to
+ *  `floor` as it reaches zero. Factored out so the monthly-budget guardrail and
+ *  the rate-window one below cannot drift apart — and so a single pair of
+ *  operator-tuned thresholds governs both (#899). */
+function headroomRamp(remainingRaw, opts) {
+    const rampStart = clampUnit(opts?.rampStart, HEADROOM_RAMP_START);
+    const floor = clampUnit(opts?.floor, HEADROOM_FLOOR);
+    const remaining = Math.max(0, Math.min(1, remainingRaw));
+    if (remaining >= rampStart)
+        return 1;
+    // Linear from (0 remaining → floor) to (rampStart remaining → 1).
+    return floor + (1 - floor) * (remaining / rampStart);
+}
+// ── Guardrail: rate-window headroom (#899) ──────────────────────────────────
+// The monthly-budget guardrail above only has an opinion about models that
+// declare a `monthly_token_budget`. The far more common free-tier shape is a
+// per-day request or token cap (rpd/tpd, plus the per-minute rpm/tpm), and
+// those were purely BINARY: canMakeRequest/canUseTokens reject at 100% and the
+// router happily keeps a model pinned at #1 until the very request that
+// exhausts it, then eats a 429 and falls through. That is exactly the
+// "deprioritize at 82% utilization, prefer the idle peer" behavior the issue
+// asks for.
+//
+// So: same ramp, same tunable thresholds, driven by live window utilization
+// instead of monthly tokens. `usedFraction` is the share of the binding window
+// limit already consumed (0 = idle, 1 = exhausted); null means the model
+// declares no window limits, or has no routable key to measure — in both cases
+// the guardrail has no opinion and returns 1.
+//
+// Recovery is automatic and needs no bookkeeping: the windows are sliding, so a
+// demoted model's utilization falls on its own as the minute or the day rolls
+// past, and the factor climbs straight back to 1.
+export function rateWindowHeadroomFactor(usedFraction, opts) {
+    if (usedFraction === null || !Number.isFinite(usedFraction))
+        return 1; // unknown → no opinion
+    return headroomRamp(1 - usedFraction, opts);
+}
+// Out-of-range / non-finite operator input falls back to the default rather
+// than silently clamping to a legal-but-unintended value (#899).
+function clampUnit(n, fallback) {
+    if (n === undefined || !Number.isFinite(n) || n < 0 || n > 1)
+        return fallback;
+    return n;
+}
+// ── Guardrail: live rate-limit penalty ──────────────────────────────────────
+// Maps the existing 0..MAX_PENALTY 429 penalty to a multiplier. At max penalty a
+// model keeps 40% of its score — demoted hard but never fully excluded, so it
+// can recover once the penalty decays.
+export const MAX_PENALTY = 10;
+export const RATE_LIMIT_MAX_DAMP = 0.6;
+export function rateLimitFactor(penalty) {
+    const p = Math.min(Math.max(0, penalty), MAX_PENALTY);
+    return 1 - (p / MAX_PENALTY) * RATE_LIMIT_MAX_DAMP;
+}
+// ── Beta sampler (Marsaglia & Tsang via two Gamma draws) ────────────────────
+function randomNormal() {
+    const u1 = Math.random() || Number.EPSILON;
+    return Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * Math.random());
+}
+function sampleGamma(shape) {
+    if (shape < 1)
+        return sampleGamma(shape + 1) * Math.pow(Math.random() || Number.EPSILON, 1 / shape);
+    const d = shape - 1 / 3;
+    const c = 1 / Math.sqrt(9 * d);
+    for (;;) {
+        let x, v;
+        do {
+            x = randomNormal();
+            v = 1 + c * x;
+        } while (v <= 0);
+        v = v ** 3;
+        const u = Math.random();
+        if (u < 1 - 0.0331 * x ** 4)
+            return d * v;
+        if (Math.log(u) < 0.5 * x * x + d * (1 - v + Math.log(v)))
+            return d * v;
+    }
+}
+export function sampleBeta(alpha, beta) {
+    const x = sampleGamma(alpha);
+    const y = sampleGamma(beta);
+    const sum = x + y;
+    return sum > 0 ? x / sum : 0.5;
+}
+/**
+ * Convex base (∈[0,1]) × the two guardrail multipliers. The weights are assumed
+ * to sum to 1; if a caller passes a non-normalized vector we renormalize so the
+ * base never escapes [0,1].
+ */
+export function combineScore(inputs, weights) {
+    const wSum = weights.reliability + weights.speed + weights.intelligence || 1;
+    const base = (weights.reliability * inputs.reliability +
+        weights.speed * inputs.speed +
+        weights.intelligence * inputs.intelligence) / wSum;
+    return base * inputs.headroom * inputs.rateLimit;
+}
+//# sourceMappingURL=scoring.js.map

package/dist/services/scoring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../src/services/scoring.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,EAAE;AACF,0EAA0E;AAC1E,gFAAgF;AAChF,+EAA+E;AAC/E,4EAA4E;AAC5E,EAAE;AACF,oEAAoE;AACpE,mEAAmE;AACnE,EAAE;AACF,4EAA4E;AAC5E,+EAA+E;AAC/E,EAAE;AACF,wDAAwD;AACxD,EAAE;AACF,4EAA4E;AAC5E,sEAAsE;AACtE,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,oEAAoE;AACpE,gFAAgF;AAChF,yDAAyD;AAqBzD,MAAM,CAAC,MAAM,cAAc,GAA4E;IACrG,mEAAmE;IACnE,QAAQ,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE;IAC/D,2EAA2E;IAC3E,wCAAwC;IACxC,QAAQ,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE;IAC/D,uEAAuE;IACvE,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE;IAC9D,iEAAiE;IACjE,QAAQ,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE;CAChE,CAAC;AAEF,iFAAiF;AACjF,wEAAwE;AACxE,0CAA0C;AAC1C,MAAM,CAAC,MAAM,gBAAgB,GAAoB,UAAU,CAAC;AA0B5D,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAC1C,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,CAAC,mDAAmD;AAC3F,MAAM,CAAC,MAAM,qBAAqB,GAAG,KAAK,CAAC;AAE3C,6EAA6E;AAC7E,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,CAAC;AAE7C,MAAM,CAAC,MAAM,kBAAkB,GAAoB;IACjD,OAAO,EAAE,KAAK;IACd,SAAS,EAAE,uBAAuB;IAClC,OAAO,EAAE,qBAAqB;IAC9B,QAAQ,EAAE,qBAAqB;CAChC,CAAC;AAEF;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAA+B,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;AAE1F,yEAAyE;AACzE,MAAM,UAAU,oBAAoB,CAAC,QAAyB;IAC5D,OAAO,sBAAsB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACnD,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,eAAe,CAAC,IAAa;IAC3C,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AACvF,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,eAAe,CAAC,QAAiB;IAC/C,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,KAAK,CAAC;IACnE,IAAI,CAAC;QACH,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,GAAS,EAAE,QAAgB;IACxD,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB,CAAC;IAC1E,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;SAClG,aAAa,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,KAAK,IAAI,GAAG,CAAC;IAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,MAAuB,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE;IACnE,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IACzF,IAAI,MAAM,CAAC,SAAS,KAAK,MAAM,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,CAAC,GAAG,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC/C,OAAO,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,OAAO;QACtC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO;QAC7C,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAoB,EACpB,QAAyB,EACzB,MAAuB,EACvB,GAAG,GAAG,IAAI,IAAI,EAAE;IAEhB,IAAI,oBAAoB,CAAC,QAAQ,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC9E,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IACzE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,yBAAyB,CAAC;IACrD,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC1D,OAAO;QACL,OAAO,EAAE;YACP,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,KAAK;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,KAAK;YACzB,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC;QACD,QAAQ,EAAE,IAAI;KACf,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,6EAA6E;AAC7E,+EAA+E;AAC/E,0EAA0E;AAC1E,yEAAyE;AACzE,8EAA8E;AAC9E,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAErC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAA+B,CAAC,GAAG,sBAAsB,EAAE,QAAQ,CAAC,CAAC;AAExG,wEAAwE;AACxE,MAAM,UAAU,oBAAoB,CAAC,QAAyB;IAC5D,OAAO,sBAAsB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,IAAoB,EACpB,IAAqB,EACrB,QAAyB,EACzB,KAAK,GAAG,iBAAiB;IAEzB,IAAI,oBAAoB,CAAC,QAAQ,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC9E,8EAA8E;IAC9E,0CAA0C;IAC1C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC1D,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACjC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1D,OAAO;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,KAAK;gBACzB,YAAY,EAAE,IAAI,CAAC,YAAY,GAAG,KAAK;aACxC;YACD,QAAQ,EAAE,IAAI;SACf,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IACxC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC1D,OAAO;QACL,OAAO,EAAE;YACP,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,KAAK;YACzB,YAAY,EAAE,IAAI,CAAC,YAAY,GAAG,KAAK;SACxC;QACD,QAAQ,EAAE,IAAI;KACf,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,iFAAiF;AACjF,gFAAgF;AAChF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAa/B,MAAM,UAAU,oBAAoB,CAClC,SAAiB,EACjB,QAAgB,EAChB,SAAqC;IAErC,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,IAAI,CAAC,CAAC,GAAG,aAAa;QAC3E,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,aAAa;KACzE,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,mBAAmB,CACjC,SAAiB,EACjB,QAAgB,EAChB,SAAqC;IAErC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,oBAAoB,CAAC,SAAS,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC7E,OAAO,KAAK,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AAChC,CAAC;AAED,+EAA+E;AAC/E,8EAA8E;AAC9E,+EAA+E;AAC/E,8EAA8E;AAC9E,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC,CAAG,mCAAmC;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC,CAAO,+BAA+B;AACtE,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC,CAAK,+BAA+B;AACtE,MAAM,iBAAiB,GAAG,GAAG,CAAC,CAAS,wBAAwB;AAC/D,MAAM,WAAW,GAAG,GAAG,CAAC;AACxB,8EAA8E;AAC9E,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAC;AAE/B,SAAS,eAAe,CAAC,SAAiB;IACxC,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7B,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,iBAAiB,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,IAAI,MAAM,IAAI,YAAY;QAAE,OAAO,CAAC,CAAC;IACrC,IAAI,MAAM,IAAI,aAAa;QAAE,OAAO,CAAC,CAAC;IACtC,OAAO,CAAC,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC;AACtE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,MAAqB;IACjE,IAAI,SAAS,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,WAAW,CAAC;IAC1D,MAAM,EAAE,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;IACtC,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,EAAE,CAAC;IAC/B,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,iBAAiB,GAAG,EAAE,GAAG,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AAClE,CAAC;AAED,+EAA+E;AAC/E,0EAA0E;AAC1E,8EAA8E;AAC9E,4EAA4E;AAC5E,+EAA+E;AAC/E,gFAAgF;AAChF,wEAAwE;AACxE,4EAA4E;AAC5E,EAAE;AACF,4EAA4E;AAC5E,iEAAiE;AACjE,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,gFAAgF;AAChF,8CAA8C;AAC9C,MAAM,CAAC,MAAM,sBAAsB,GAAG,OAAO,CAAC;AAE9C,+EAA+E;AAC/E,8EAA8E;AAC9E,4EAA4E;AAC5E,gFAAgF;AAChF,wEAAwE;AACxE,gFAAgF;AAChF,wEAAwE;AACxE,iCAAiC;AACjC,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAC1C,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAE5C,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,yBAAyB,GAAG,wBAAwB,CAAC;IAClE,OAAO,wBAAwB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC/D,CAAC;AAED,+EAA+E;AAC/E,4EAA4E;AAC5E,8EAA8E;AAC9E,+EAA+E;AAC/E,6EAA6E;AAC7E,6EAA6E;AAC7E,wEAAwE;AACxE,8EAA8E;AAC9E,yEAAyE;AACzE,2EAA2E;AAC3E,4EAA4E;AAC5E,mEAAmE;AACnE,uEAAuE;AACvE,MAAM,CAAC,MAAM,UAAU,GAA2B,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAEjG,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,OAAO,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,8EAA8E;AAC9E,8EAA8E;AAC9E,wEAAwE;AACxE,wEAAwE;AACxE,8EAA8E;AAC9E,6EAA6E;AAC7E,8EAA8E;AAC9E,4EAA4E;AAC5E,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB,MAAM,UAAU,qBAAqB,CAAC,SAAiB,EAAE,gBAAwB;IAC/E,2EAA2E;IAC3E,mEAAmE;IACnE,OAAO,SAAS,CAAC,SAAS,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,GAAG,UAAU,CAAC;AAC7F,CAAC;AAED,iFAAiF;AACjF,iFAAiF;AACjF,MAAM,UAAU,iBAAiB,CAAC,SAAiB,EAAE,GAAW,EAAE,GAAW;IAC3E,IAAI,GAAG,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC,CAAC,2CAA2C;IACrE,OAAO,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AACzC,CAAC;AAED,+EAA+E;AAC/E,gFAAgF;AAChF,gFAAgF;AAChF,+EAA+E;AAC/E,wEAAwE;AACxE,6EAA6E;AAC7E,8EAA8E;AAC9E,qEAAqE;AACrE,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC;AAClC,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC,CAAC,oCAAoC;AAS5E,MAAM,UAAU,cAAc,CAAC,UAAkB,EAAE,YAAoB,EAAE,IAAyB;IAChG,IAAI,CAAC,YAAY,IAAI,YAAY,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,8BAA8B;IAChF,OAAO,YAAY,CAAC,CAAC,GAAG,UAAU,GAAG,YAAY,EAAE,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED;;;;qDAIqD;AACrD,SAAS,YAAY,CAAC,YAAoB,EAAE,IAAyB;IACnE,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,mBAAmB,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;IACzD,IAAI,SAAS,IAAI,SAAS;QAAE,OAAO,CAAC,CAAC;IACrC,kEAAkE;IAClE,OAAO,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;AACvD,CAAC;AAED,+EAA+E;AAC/E,2EAA2E;AAC3E,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,wEAAwE;AACxE,sEAAsE;AACtE,6EAA6E;AAC7E,YAAY;AACZ,EAAE;AACF,4EAA4E;AAC5E,+EAA+E;AAC/E,yEAAyE;AACzE,+EAA+E;AAC/E,8CAA8C;AAC9C,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,kDAAkD;AAClD,MAAM,UAAU,wBAAwB,CAAC,YAA2B,EAAE,IAAyB;IAC7F,IAAI,YAAY,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,uBAAuB;IAC9F,OAAO,YAAY,CAAC,CAAC,GAAG,YAAY,EAAE,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED,4EAA4E;AAC5E,iEAAiE;AACjE,SAAS,SAAS,CAAC,CAAqB,EAAE,QAAgB;IACxD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC9E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+EAA+E;AAC/E,iFAAiF;AACjF,8EAA8E;AAC9E,uCAAuC;AACvC,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC;AAC9B,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC,MAAM,UAAU,eAAe,CAAC,OAAe;IAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,CAAC;IACtD,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,mBAAmB,CAAC;AACrD,CAAC;AAED,+EAA+E;AAC/E,SAAS,YAAY;IACnB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,CAAC,OAAO,CAAC;IAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,WAAW,CAAC,KAAa;IAChC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;IACpG,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,SAAS,CAAC;QACR,IAAI,CAAS,EAAE,CAAS,CAAC;QACzB,GAAG,CAAC;YAAC,CAAC,GAAG,YAAY,EAAE,CAAC;YAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;QACzD,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACX,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,IAAY;IACpD,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACjC,CAAC;AAWD;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,MAAmB,EAAE,OAAuB;IACvE,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,GAAG,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;IAC7E,MAAM,IAAI,GACR,CAAC,OAAO,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW;QACvC,OAAO,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK;QAC5B,OAAO,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC;IACvD,OAAO,IAAI,GAAG,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC;AACnD,CAAC"}

package/dist/services/url-tokens.d.ts

@@ -0,0 +1,15 @@
+export interface UrlTokenRow {
+    id: number;
+    label: string;
+    tokenPrefix: string;
+    createdAt: string;
+    lastUsedAt: string | null;
+    revokedAt: string | null;
+}
+export declare function listUrlTokens(): UrlTokenRow[];
+export declare function mintUrlToken(label: string): UrlTokenRow & {
+    token: string;
+};
+export declare function revokeUrlToken(id: number): boolean;
+export declare function validateUrlToken(token: string): boolean;
+//# sourceMappingURL=url-tokens.d.ts.map

package/dist/services/url-tokens.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"url-tokens.d.ts","sourceRoot":"","sources":["../../src/services/url-tokens.ts"],"names":[],"mappings":"AAQA,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED,wBAAgB,aAAa,IAAI,WAAW,EAAE,CAqB7C;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAS3E;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAKlD;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAiBvD"}

package/dist/services/url-tokens.js

@@ -0,0 +1,55 @@
+import crypto from 'crypto';
+import { getDb, getUnifiedApiKey } from '../db/index.js';
+import { timingSafeStringEqual } from '../routes/proxy.js';
+function hashToken(token) {
+    return crypto.createHash('sha256').update(token).digest('hex');
+}
+export function listUrlTokens() {
+    const rows = getDb().prepare(`
+    SELECT id, label, token_prefix, created_at, last_used_at, revoked_at
+    FROM url_tokens
+    ORDER BY id DESC
+  `).all();
+    return rows.map(row => ({
+        id: row.id,
+        label: row.label,
+        tokenPrefix: row.token_prefix,
+        createdAt: row.created_at,
+        lastUsedAt: row.last_used_at,
+        revokedAt: row.revoked_at,
+    }));
+}
+export function mintUrlToken(label) {
+    const token = `flmurl_${crypto.randomBytes(24).toString('base64url')}`;
+    const prefix = `${token.slice(0, 12)}…`;
+    const result = getDb().prepare(`
+    INSERT INTO url_tokens (token_hash, label, token_prefix)
+    VALUES (?, ?, ?)
+  `).run(hashToken(token), label.trim(), prefix);
+    const row = listUrlTokens().find(entry => entry.id === Number(result.lastInsertRowid));
+    return { ...row, token };
+}
+export function revokeUrlToken(id) {
+    return getDb().prepare(`
+    UPDATE url_tokens SET revoked_at = datetime('now')
+    WHERE id = ? AND revoked_at IS NULL
+  `).run(id).changes > 0;
+}
+export function validateUrlToken(token) {
+    if (!token || timingSafeStringEqual(token, getUnifiedApiKey())) {
+        if (token) {
+            console.warn('[URL tokens] Rejected a raw unified API key in a tokenized URL');
+        }
+        return false;
+    }
+    const hash = hashToken(token);
+    const row = getDb().prepare(`
+    SELECT id FROM url_tokens
+    WHERE token_hash = ? AND revoked_at IS NULL
+  `).get(hash);
+    if (!row)
+        return false;
+    getDb().prepare("UPDATE url_tokens SET last_used_at = datetime('now') WHERE id = ?").run(row.id);
+    return true;
+}
+//# sourceMappingURL=url-tokens.js.map

package/dist/services/url-tokens.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"url-tokens.js","sourceRoot":"","sources":["../../src/services/url-tokens.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,SAAS,SAAS,CAAC,KAAa;IAC9B,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACjE,CAAC;AAWD,MAAM,UAAU,aAAa;IAC3B,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC;;;;GAI5B,CAAC,CAAC,GAAG,EAOJ,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtB,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,WAAW,EAAE,GAAG,CAAC,YAAY;QAC7B,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,UAAU,EAAE,GAAG,CAAC,YAAY;QAC5B,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,MAAM,KAAK,GAAG,UAAU,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;IACvE,MAAM,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;IACxC,MAAM,MAAM,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC;;;GAG9B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAE,CAAC;IACxF,OAAO,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,KAAK,EAAE,CAAC,OAAO,CAAC;;;GAGtB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,IAAI,CAAC,KAAK,IAAI,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC;QAC/D,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC;;;GAG3B,CAAC,CAAC,GAAG,CAAC,IAAI,CAA+B,CAAC;IAC3C,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IACvB,KAAK,EAAE,CAAC,OAAO,CACb,mEAAmE,CACpE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,IAAI,CAAC;AACd,CAAC"}

package/package.json

@@ -1,6 +1,79 @@
 {
   "name": "@srouterhq/server",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
-}
+  "version": "0.9.0",
+  "description": "SRouter gateway server — free open-source LLM router with a multi-provider failover proxy and dashboard",
+  "license": "MIT",
+  "type": "module",
+  "main": "./dist/index.js",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/baiibayu/srouter.git",
+    "directory": "server"
+  },
+  "homepage": "https://github.com/baiibayu/srouter/tree/main/server#readme",
+  "bugs": {
+    "url": "https://github.com/baiibayu/srouter/issues"
+  },
+  "files": [
+    "dist",
+    "client/dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "dev": "tsx watch src/index.ts",
+    "build": "tsc",
+    "start": "node dist/index.js",
+    "test": "vitest run --pool=forks --fileParallelism=false",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --pool=forks --fileParallelism=false --coverage",
+    "test:migrations": "vitest run --pool=forks --fileParallelism=false src/__tests__/db/migrate/roundtrip.test.ts",
+    "lint": "eslint .",
+    "export-catalog": "tsx src/scripts/export-catalog.ts",
+    "rotate-encryption-key": "tsx src/scripts/rotate-encryption-key.ts",
+    "db:migration:up": "tsx src/db/migrate/cli.ts up",
+    "db:migration:down": "tsx src/db/migrate/cli.ts down",
+    "db:migration:fresh": "tsx src/db/migrate/cli.ts fresh",
+    "db:migration:status": "tsx src/db/migrate/cli.ts status",
+    "db:migration:create": "tsx src/db/migrate/cli.ts create",
+    "prepack": "node ../scripts/prepare-server-pack.mjs"
+  },
+  "dependencies": {
+    "ajv": "^8.20.0",
+    "compression": "^1.8.0",
+    "cors": "^2.8.5",
+    "dotenv": "^17.4.2",
+    "express": "^5.1.0",
+    "helmet": "^8.1.0",
+    "multer": "^2.2.0",
+    "sharp": "^0.35.3",
+    "socks-proxy-agent": "^10.0.0",
+    "undici": "^6.21.0",
+    "zod": "^3.24.4"
+  },
+  "devDependencies": {
+    "@eslint/js": "^9.39.4",
+    "@srouter/shared": "*",
+    "@types/better-sqlite3": "^7.6.13",
+    "@types/compression": "^1.7.5",
+    "@types/cors": "^2.8.17",
+    "@types/express": "^5.0.2",
+    "@types/multer": "^2.1.0",
+    "@types/node": "^22.15.3",
+    "@vitest/coverage-v8": "^3.1.3",
+    "eslint": "^9.39.4",
+    "globals": "^17.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3",
+    "typescript-eslint": "^8.58.0",
+    "vitest": "^3.1.3"
+  },
+  "engines": {
+    "node": ">=20.18.0 <25.0.0",
+    "npm": ">=10.0.0"
+  },
+  "optionalDependencies": {
+    "better-sqlite3": "^12.10.0"
+  }
+}

package/README.md

@@ -1,3 +0,0 @@
-# Temporary Holding Version
-
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.