feat: Phase 1 — extract the client (web SPA + desktop) to dtoro/oikos-web

Problem: the hexagonal refactor churns the backend tree for nine more
phases; the UI delivery stack (web/ SPA, cmd/desktop Wails wrapper,
compose/web image) must move to its own repo first so doc/layout
rewrites land once on a backend-only tree.

Change:
- New repo git.hubris.network/dtoro/oikos-web (v0.33.0): web/, desktop/
  (updateURL repointed to oikos-web releases), compose/, own CI (web +
  desktop jobs), own deploy script (CI-green gate, TOCTOU guard,
  version-tagged images, prune-to-3), own webhook receiver on :9798 +
  launchd unit, own compose project publishing the same 8091:80.
- Cutover executed on mac-mini in order: oikos stack's web service
  stopped+removed, oikos-web project brought up on 8091; outer Caddy
  untouched (targets the published port) — serving + Authentik flow +
  /wails 404 quirk verified post-cutover.
- Stripped from oikos: web/, cmd/desktop/, compose/web/, desktop CI
  workflow, ci.yml web job, Makefile ui/desktop/desktop-package/install
  targets, the compose web service, oikos-web from deploy.sh's fallback
  prune list; wails + go-keyring dropped from go.mod, vendor synced.
- README / CONTRIBUTING / AGENTS.md / .agents dev+operations docs now
  point at the new repo; mbse + mascot design docs carry a path note.

Risk: production SPA serving depends on the new pipeline now; rollback
is versioned-image re-up of the old web service from a pre-split
checkout (port 8091). Desktop builds installed before the split still
check dtoro/oikos releases — one manual reinstall, noted in the
oikos-web release notes.

Verification: go vet, make test (race), make generate-check, golangci
(no new findings; baseline down 400→365); post-cutover curls —
localhost:8091 200, /wails/runtime.js 404, outer Caddy 302 Authentik.

web/node_modules/svelte-eslint-parser/lib/utils/index.js

@@ -0,0 +1,79 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addElementToSortedArray = addElementToSortedArray;
+exports.addElementsToSortedArray = addElementsToSortedArray;
+exports.sortedLastIndex = sortedLastIndex;
+exports.hasTypeInfo = hasTypeInfo;
+/**
+ * Add element to a sorted array
+ */
+function addElementToSortedArray(array, element, compare) {
+    const index = sortedLastIndex(array, (target) => compare(target, element));
+    array.splice(index, 0, element);
+}
+/**
+ * Add element to a sorted array
+ */
+function addElementsToSortedArray(array, elements, compare) {
+    if (!elements.length) {
+        return;
+    }
+    let last = elements[0];
+    let index = sortedLastIndex(array, (target) => compare(target, last));
+    for (const element of elements) {
+        if (compare(last, element) > 0) {
+            index = sortedLastIndex(array, (target) => compare(target, element));
+        }
+        let e = array[index];
+        while (e && compare(e, element) <= 0) {
+            e = array[++index];
+        }
+        array.splice(index, 0, element);
+        last = element;
+    }
+}
+/**
+ * Uses a binary search to determine the highest index at which value should be inserted into array in order to maintain its sort order.
+ */
+function sortedLastIndex(array, compare) {
+    let lower = 0;
+    let upper = array.length;
+    while (lower < upper) {
+        const mid = Math.floor(lower + (upper - lower) / 2);
+        const target = compare(array[mid]);
+        if (target < 0) {
+            lower = mid + 1;
+        }
+        else if (target > 0) {
+            upper = mid;
+        }
+        else {
+            return mid + 1;
+        }
+    }
+    return upper;
+}
+function hasTypeInfo(element) {
+    var _a;
+    if ((_a = element.type) === null || _a === void 0 ? void 0 : _a.startsWith("TS")) {
+        return true;
+    }
+    for (const key of Object.keys(element)) {
+        if (key === "parent")
+            continue;
+        const value = element[key];
+        if (value == null)
+            continue;
+        if (typeof value === "object") {
+            if (hasTypeInfo(value))
+                return true;
+        }
+        else if (Array.isArray(value)) {
+            for (const v of value) {
+                if (typeof v === "object" && hasTypeInfo(v))
+                    return true;
+            }
+        }
+    }
+    return false;
+}