Web USD on the Space, dark (VIEWER_FORMAT unset = glb): UI slim-ui-6262a66a + #72's serving files

Owner go 2026-10-15 (Web USD upload). Dist = indexing #73 (slim-ui-license 6262a66a = live b62bb449 + webusd/slim-viewer 7d9549c6). Runtime files = indexing #72 @02d329c0 (nginx: prod's rail lists kept; #59's rail names ship with Artem's deploy). Nothing reads the USD archives until VIEWER_FORMAT is usd or auto.

docker/hf-space/nginx.conf.template

@@ -43,6 +43,13 @@ map $arg_v $slim_library_cache {
     ""      "no-cache";
     default "public, max-age=31536000, immutable";
 }
+# Web USD (/library_media/<id>/usd/*.usdc, below): a client whose Accept-Encoding names br gets the precompressed
+# <file>.br sibling the media builder ships; `br;q=0` refuses it (RFC 9110 12.5.3). First match wins.
+map $http_accept_encoding $slim_accepts_br {
+    default                                               0;
+    "~*(^|,)\s*br\s*;\s*q\s*=\s*0(\.0{0,3})?\s*(,|$)"      0;
+    "~*(^|,)\s*br\s*(;|,|$)"                               1;
+}
 # <<< simready-central slim explorer (http) <<<
 server {
     listen __PORT__;
@@ -199,10 +206,28 @@ server {
     # category.qcode_property central:category: the Category tree (only the tree) reads the property the pipeline's
     # `categories` stage writes (pipeline/categories.py): the asset's Q-code, or oem:<HF owner> for a partner package,
     # so OEM > vendor scopes to that vendor and no asset is left Uncategorized. Search and parsing keep the Q-code.
+    # viewerFormat (Web USD's runtime switch, 2026-10-14): __VIEWER_FORMAT__ is rendered by the same sed from the
+    # Space variable VIEWER_FORMAT — glb (the default, also for anything but glb|usd|auto), usd or auto. The Explorer
+    # reads it over its baked REACT_APP_VIEWER_FORMAT, so web USD goes off with a variable and a restart, no rebuild;
+    # pipeline/library_media.py fetches the USD archives only when it is usd or auto.
     location = /config.js {
         default_type application/javascript;
         add_header Cache-Control "no-cache, must-revalidate" always;
-        return 200 '(function(){var c="__CORPUS_NAME__";if(!c||c.indexOf("__")===0){c="usdsearch-dev";}window.__SERVER_MAPPING__={"usdsearch-dev":{"name":c+" (Hugging Face)","apiUrl":"","embedding_config":{"field_name":"siglip2-embedding.embedding","dimension":1536},"category":{"qcode_property":"central:category"},"features":{"download":__DOWNLOAD_ENABLED__,"s3UrlRemap":false,"seedDefaultScope":false,"railFilters":["profiles","simready_metadata_asset_license","category"],"railDefaults":["profiles","simready_metadata_asset_license","category"],"propertyAliases":{"wikidata_qcode":"simready_metadata_qcode"},"propertyFilterCombine":"and","submitContentUrl":"__SUBMIT_CONTENT_URL__"}}};window.__DEFAULT_SERVER__="usdsearch-dev";})();';
+        return 200 '(function(){var c="__CORPUS_NAME__";if(!c||c.indexOf("__")===0){c="usdsearch-dev";}window.__SERVER_MAPPING__={"usdsearch-dev":{"name":c+" (Hugging Face)","apiUrl":"","embedding_config":{"field_name":"siglip2-embedding.embedding","dimension":1536},"category":{"qcode_property":"central:category"},"features":{"download":__DOWNLOAD_ENABLED__,"s3UrlRemap":false,"seedDefaultScope":false,"railFilters":["profiles","simready_metadata_asset_license","category"],"railDefaults":["profiles","simready_metadata_asset_license","category"],"propertyAliases":{"wikidata_qcode":"simready_metadata_qcode"},"propertyFilterCombine":"and","submitContentUrl":"__SUBMIT_CONTENT_URL__","viewerFormat":"__VIEWER_FORMAT__"}}};window.__DEFAULT_SERVER__="usdsearch-dev";})();';
+    }
+    # The Web USD reader (SimReady Central's explorer/scripts/copy-usd-reader.js: /static/usd-reader/<revision>/, a
+    # module worker's few small .js files and its ~2.3 MB WebAssembly). The stock gzip_types (and the server's line
+    # above) name no application/wasm, so without this the .wasm goes out raw: a .gz sibling the dist ships is sent as
+    # is (gzip_static), else it is gzipped here. Same files and folder as the /static/ alias above; longer prefix wins.
+    location /static/usd-reader/ {
+        alias /usr/share/nginx/explorer/static/usd-reader/;
+        types { application/wasm wasm; application/javascript js; }
+        default_type application/octet-stream;
+        gzip_static on;
+        gzip on;
+        gzip_comp_level 6;
+        gzip_vary on;
+        gzip_types application/wasm application/javascript;
     }
     # index.html must always revalidate (covers the try_files fallback too): a swap or rollback
     # must not leave a browser holding an index.html that names deleted chunks.
@@ -296,7 +321,7 @@ server {
     location /library_media/ {
         root /app/hf-space-pipeline/.build;   # .build/library_media/: outside .build/restore/, which the index restore empties
         try_files $uri @slim_not_found;
-        types { application/json json; model/gltf-binary glb; video/mp4 mp4; image/jpeg jpg; image/webp webp; }
+        types { application/json json; model/gltf-binary glb; video/mp4 mp4; image/jpeg jpg; image/webp webp; image/ktx2 ktx2; image/png png; }
         default_type application/octet-stream;
         gzip_types application/json model/gltf-binary;   # meshopt GLBs still shrink under gzip
         add_header Cache-Control $slim_library_cache always;
@@ -305,6 +330,47 @@ server {
         add_header Access-Control-Allow-Methods "GET, POST, OPTIONS" always;
         add_header Access-Control-Allow-Headers "Content-Type, Authorization" always;
     }
+    # Web USD (manifest entry `usd`, SimReady Central's simready-web-usd/1): <id>/usd/{asset,hd,colliders}.usdc beside
+    # its KTX2 textures (<id>/usd/tex/*.ktx2, served by the location above: image/ktx2, Range, never gzipped — Basis
+    # is compressed already). A .usdc whose client accepts br is answered with the builder's precompressed
+    # <file>.usdc.br (Content-Encoding: br; whole, never a Range: a byte range of an encoded body is not one of the
+    # file), else, or without a .br sibling, with the file itself (Range as usual). Both vary on Accept-Encoding. No
+    # gzip_static: the builder writes no .gz, and the dynamic gzip never takes application/octet-stream.
+    location ~ ^/library_media/.+\.usdc$ {
+        root /app/hf-space-pipeline/.build;
+        error_page 418 = @slim_usdc_identity;
+        if ($slim_accepts_br = 0) { return 418; }
+        try_files $uri.br @slim_usdc_identity;
+        types { }
+        default_type application/octet-stream;
+        gzip off;
+        max_ranges 0;
+        add_header Content-Encoding br;
+        add_header Vary Accept-Encoding always;
+        add_header Cache-Control $slim_library_cache always;
+        add_header X-Content-Type-Options nosniff always;
+        add_header Access-Control-Allow-Origin "*" always;
+        add_header Access-Control-Allow-Methods "GET, POST, OPTIONS" always;
+        add_header Access-Control-Allow-Headers "Content-Type, Authorization" always;
+    }
+    location @slim_usdc_identity {
+        root /app/hf-space-pipeline/.build;
+        try_files $uri @slim_not_found;
+        types { }
+        default_type application/octet-stream;
+        gzip off;
+        add_header Vary Accept-Encoding always;
+        add_header Cache-Control $slim_library_cache always;
+        add_header X-Content-Type-Options nosniff always;
+        add_header Access-Control-Allow-Origin "*" always;
+        add_header Access-Control-Allow-Methods "GET, POST, OPTIONS" always;
+        add_header Access-Control-Allow-Headers "Content-Type, Authorization" always;
+    }
+    # A .br sibling is an encoding of its file, never a URL of its own.
+    location ~ ^/library_media/.+\.br$ {
+        default_type application/json;
+        return 404 '{"detail":"Not Found"}';
+    }
     # Central's per-user surface is absent in this build: hard 404s, never the SPA's index.html.
     location ~ ^/(auth|packs|prefs|chats|created_assets|concept_images|meshy_quota|info|process|folder_hierarchy\.json|category_hierarchy\.json|api/create-chat|api/cad2simready)(/|$) {
         default_type application/json;

docker/hf-space/supervisord-gpu.conf

@@ -171,7 +171,7 @@ stderr_logfile=/dev/stderr
 stderr_logfile_maxbytes=0
 
 [program:nginx]
-command=/bin/sh -c "until curl -sf http://localhost:8000/health >/dev/null 2>&1 && curl -sf http://localhost:8010/docs >/dev/null 2>&1; do sleep 2; done; dl=false; case '%(ENV_DOWNLOAD_ENABLED)s' in [Tt]rue|1) if [ -f /app/hf-space-pipeline/.build/restore/hf-storage-api-catalog.yaml ]; then dl=true; else echo 'nginx: no hf-storage-api catalog, rendering download:false' >&2; fi;; esac; sed -e 's/__PORT__/%(ENV_PORT)s/' -e 's|__CORPUS_NAME__|%(ENV_CORPUS_NAME)s|g' -e 's/__DOWNLOAD_ENABLED__/'$dl'/' -e 's|__SUBMIT_CONTENT_URL__|%(ENV_SUBMIT_CONTENT_URL)s|g' /etc/nginx/hf-space.conf.template > /etc/nginx/conf.d/hf-space.conf && exec nginx -g 'daemon off;'"
+command=/bin/sh -c "until curl -sf http://localhost:8000/health >/dev/null 2>&1 && curl -sf http://localhost:8010/docs >/dev/null 2>&1; do sleep 2; done; dl=false; case '%(ENV_DOWNLOAD_ENABLED)s' in [Tt]rue|1) if [ -f /app/hf-space-pipeline/.build/restore/hf-storage-api-catalog.yaml ]; then dl=true; else echo 'nginx: no hf-storage-api catalog, rendering download:false' >&2; fi;; esac; vf=glb; case $VIEWER_FORMAT in glb|usd|auto) vf=$VIEWER_FORMAT;; '') ;; *) echo 'nginx: VIEWER_FORMAT is not glb, usd or auto: rendering viewerFormat glb' >&2;; esac; sed -e 's/__PORT__/%(ENV_PORT)s/' -e 's|__CORPUS_NAME__|%(ENV_CORPUS_NAME)s|g' -e 's/__DOWNLOAD_ENABLED__/'$dl'/' -e 's|__SUBMIT_CONTENT_URL__|%(ENV_SUBMIT_CONTENT_URL)s|g' -e 's/__VIEWER_FORMAT__/'$vf'/' /etc/nginx/hf-space.conf.template > /etc/nginx/conf.d/hf-space.conf && exec nginx -g 'daemon off;'"
 user=root
 autorestart=true
 startsecs=3

docker/hf-space/supervisord.conf

@@ -210,7 +210,7 @@ stderr_logfile_maxbytes=0
 ; deepsearch-api used to follow directly before nginx sat in front of it.
 ; %(ENV_PORT)s is substituted by supervisord itself, so no extra templating
 ; tool (envsubst etc.) is needed in the image.
-command=/bin/sh -c "until curl -sf http://localhost:8000/health >/dev/null 2>&1 && curl -sf http://localhost:8010/docs >/dev/null 2>&1; do sleep 2; done; dl=false; case '%(ENV_DOWNLOAD_ENABLED)s' in [Tt]rue|1) if [ -f /app/hf-space-pipeline/.build/restore/hf-storage-api-catalog.yaml ]; then dl=true; else echo 'nginx: no hf-storage-api catalog, rendering download:false' >&2; fi;; esac; sed -e 's/__PORT__/%(ENV_PORT)s/' -e 's|__CORPUS_NAME__|%(ENV_CORPUS_NAME)s|g' -e 's/__DOWNLOAD_ENABLED__/'$dl'/' -e 's|__SUBMIT_CONTENT_URL__|%(ENV_SUBMIT_CONTENT_URL)s|g' /etc/nginx/hf-space.conf.template > /etc/nginx/conf.d/hf-space.conf && exec nginx -g 'daemon off;'"
+command=/bin/sh -c "until curl -sf http://localhost:8000/health >/dev/null 2>&1 && curl -sf http://localhost:8010/docs >/dev/null 2>&1; do sleep 2; done; dl=false; case '%(ENV_DOWNLOAD_ENABLED)s' in [Tt]rue|1) if [ -f /app/hf-space-pipeline/.build/restore/hf-storage-api-catalog.yaml ]; then dl=true; else echo 'nginx: no hf-storage-api catalog, rendering download:false' >&2; fi;; esac; vf=glb; case $VIEWER_FORMAT in glb|usd|auto) vf=$VIEWER_FORMAT;; '') ;; *) echo 'nginx: VIEWER_FORMAT is not glb, usd or auto: rendering viewerFormat glb' >&2;; esac; sed -e 's/__PORT__/%(ENV_PORT)s/' -e 's|__CORPUS_NAME__|%(ENV_CORPUS_NAME)s|g' -e 's/__DOWNLOAD_ENABLED__/'$dl'/' -e 's|__SUBMIT_CONTENT_URL__|%(ENV_SUBMIT_CONTENT_URL)s|g' -e 's/__VIEWER_FORMAT__/'$vf'/' /etc/nginx/hf-space.conf.template > /etc/nginx/conf.d/hf-space.conf && exec nginx -g 'daemon off;'"
 user=root
 autorestart=true
 startsecs=3

pipeline/library_media.py

@@ -30,6 +30,25 @@ a sibling archive of the same stamp, ``media-<stamp>.hd.tar``, which ARCHIVE nev
 installed and served, it is STREAMED in (no copy of the archive on disk): each member the manifest lists lands
 under ``<id>/<file>`` through a temporary file, anything else is skipped. Until a file lands the Explorer reads a
 404 and stays on tier 1, quietly; a failure leaves what landed.
+
+Web USD (an entry's ``usd`` block, profile simready-web-usd/1, 2026-10-14) never touches the two archives above:
+it travels in two more siblings of the same stamp, loaded after them, each with its own disk check, so the GLB tiers
+are fetched exactly as before whatever the USD costs:
+
+- ``media-<stamp>.usd.tar``: first member ``usd-manifest.json`` (the blocks, ``{version: 1, profile, assets: {Space
+  key: {id, usd}}}``), then per entry ``<id>/usd/asset.usdc``, ``usd/colliders.usdc`` (each + its ``.br``), the
+  export's own ``usd/articulation.json`` and the tier-1 KTX2 in ``usd/tex/``;
+- ``media-<stamp>.usdhd.tar``: ``<id>/usd/hd.usdc`` (+ ``.br``) and the KTX2 only the full level binds
+  (``ktx2.full``).
+
+Both are streamed like the HD archive (only listed paths, all under ``<id>/usd/``). The served manifest never names a
+file that is not there: a ``usd`` block in the main archive's manifest is dropped at install; once the USD archive has
+landed, the blocks whose tier-1 files are all there are added WITHOUT their full level (no ``files.hd``, no
+``ktx2.full``); once the USD HD archive has landed, the blocks whose full-level files are all there get it back. A
+skipped or failed USD HD archive leaves tier 1; a skipped or failed USD archive leaves the GLB alone. Nothing of
+either is fetched unless the Space's ``VIEWER_FORMAT`` (the Explorer's /config.js ``features.viewerFormat``, rendered
+by supervisord.conf) is ``usd`` or ``auto``; LIBRARY_MEDIA_USD=off / LIBRARY_MEDIA_USD_HD=off skip one or both. nginx
+serves a ``.usdc`` as its ``.br`` to a client that accepts brotli.
 """
 
 from __future__ import annotations
@@ -58,8 +77,17 @@ DISABLED = {"off", "none", "false", "0"}
 HD_SUFFIX = ".hd.tar"
 SAFE_ID = re.compile(r"^[A-Za-z0-9_-]{1,64}$")
 SAFE_NAME = re.compile(r"^[A-Za-z0-9_-][A-Za-z0-9._-]{0,127}$")
+USD_MAX_DEPTH = 4    # segments of a web USD path below its entry: usd/tex/<name>.ktx2 has 3
 HD_TRIES = 2
-HD_DISK_MARGIN = 8 * 10**9   # free disk the HD stream always leaves (the index, Neo4j and logs keep writing)
+HD_DISK_MARGIN = 8 * 10**9   # free disk each streamed archive always leaves (the index, Neo4j and logs keep writing)
+# Web USD (see the module doc): two more siblings of the archive's stamp, after the GLB ones.
+USD_SUFFIX = ".usd.tar"
+USD_HD_SUFFIX = ".usdhd.tar"
+USD_OVERLAY = "usd-manifest.json"     # the USD archive's first member: the blocks
+USD_OVERLAY_MAX = 64 * 2**20
+USD_PROFILE = "simready-web-usd/1"
+USD_ASSET = "usd/asset.usdc"
+VIEWER_FORMATS = ("glb", "usd", "auto")   # the Space's VIEWER_FORMAT; anything else is "glb" (supervisord.conf too)
 
 
 def run_prefix(cfg: Config, store, corpus: str) -> str:
@@ -121,10 +149,75 @@ def install(src: Path, dest: Path) -> None:
     shutil.rmtree(old, ignore_errors=True)
 
 
+def safe_rel(path) -> bool:
+    """A file path below an entry's folder: 1 to USD_MAX_DEPTH SAFE_NAME segments joined by "/" (so never "", "."
+    or "..", never absolute)."""
+    if not isinstance(path, str):
+        return False
+    parts = path.split("/")
+    return len(parts) <= USD_MAX_DEPTH and all(SAFE_NAME.match(p) for p in parts)
+
+
+def usd_path(path) -> bool:
+    """A web USD file path: under the entry's ``usd/`` folder, safe (``safe_rel``)."""
+    return isinstance(path, str) and path.startswith("usd/") and safe_rel(path)
+
+
+def usd_block_ok(usd) -> bool:
+    """A ``usd`` block the loader can place: the profile, ``files.asset`` = usd/asset.usdc, every file and KTX2 path a
+    ``usd_path`` (the KTX2 ending .ktx2), ``br`` a list of strings. Anything else is no block (the GLB stays)."""
+    if not isinstance(usd, dict) or usd.get("profile") != USD_PROFILE:
+        return False
+    files, ktx2, br = usd.get("files"), usd.get("ktx2", {}), usd.get("br", [])
+    if not isinstance(files, dict) or files.get("asset") != USD_ASSET or not all(map(usd_path, files.values())):
+        return False
+    if not isinstance(ktx2, dict) or not isinstance(br, list) or not all(isinstance(n, str) for n in br):
+        return False
+    lists = [ktx2.get(k, []) for k in ("tier1", "full")]
+    return all(isinstance(lst, list) and all(usd_path(p) and p.endswith(".ktx2") for p in lst) for lst in lists)
+
+
+def _with_br(usd: dict, names: set[str]) -> set[str]:
+    return names | {f"{n}.br" for n in usd.get("br", []) if n in names}
+
+
+def usd_tier1_files(usd) -> set[str]:
+    """The USD archive's files of a block: every ``files`` role but ``hd`` (asset, colliders, articulation), the
+    tier-1 KTX2 (``ktx2.tier1``) and the ``.br`` sibling of each the block names in ``br``; none for a malformed
+    block."""
+    if not usd_block_ok(usd):
+        return set()
+    names = {p for role, p in usd["files"].items() if role != "hd"} | set(usd.get("ktx2", {}).get("tier1", []))
+    return _with_br(usd, names)
+
+
+def usd_hd_files(usd) -> set[str]:
+    """The USD HD archive's files of a block: ``files.hd`` (usd/hd.usdc), the KTX2 only the full level binds
+    (``ktx2.full``) and the ``.br`` sibling of each the block names in ``br``; none without ``files.hd`` or for a
+    malformed block."""
+    if not usd_block_ok(usd) or not usd["files"].get("hd"):
+        return set()
+    return _with_br(usd, {usd["files"]["hd"], *usd.get("ktx2", {}).get("full", [])})
+
+
+def usd_without_hd(usd: dict) -> dict:
+    """The block as tier 1 alone: no ``files.hd``, no ``ktx2.full``, their ``.br`` names gone, ``bytes.full`` 0 — the
+    Explorer then never asks for a tier 2 that is not there."""
+    out = json.loads(json.dumps(usd))
+    gone = usd_hd_files(usd)
+    out["files"].pop("hd", None)
+    if isinstance(out.get("ktx2"), dict):
+        out["ktx2"]["full"] = []
+    out["br"] = [n for n in out.get("br", []) if n not in gone]
+    if isinstance(out.get("bytes"), dict):
+        out["bytes"]["full"] = 0
+    return out
+
+
 def hd_files(manifest: dict) -> dict[str, set[str]]:
     """{entry id: file names} of the HD tiers the manifest lists: an entry's ``hd`` files (model_hd.glb), its spin's
     HD frames (``spin.hd``: ``spin_hd_{k:03d}.webp`` for every k below ``spin.frames``) and its RTX clip's HD files
-    (``rtxclip.hd``). The only members an HD archive may write."""
+    (``rtxclip.hd``). The only members an HD archive may write (web USD has archives of its own)."""
     out: dict[str, set[str]] = {}
     for e in (manifest.get("assets") or {}).values():
         if not isinstance(e, dict) or not isinstance(e.get("id"), str) or not SAFE_ID.match(e["id"]):
@@ -146,37 +239,145 @@ def hd_files(manifest: dict) -> dict[str, set[str]]:
     return out
 
 
+def _write_member(tf, m, tree: Path, allowed: dict[str, set[str]]) -> tuple[int, int, int]:
+    """One member of a streamed archive: written under ``<id>/<path>`` when ``allowed`` lists it (through a temporary
+    file, so nginx never serves half of one; a file already there at the member's size is kept: a retried stream),
+    else skipped. (written, bytes, skipped), each 0 or 1 / the size."""
+    if m.isdir():
+        return 0, 0, 0
+    parts = m.name.removeprefix("./").split("/")
+    rel = "/".join(parts[1:])
+    if not m.isfile() or len(parts) < 2 or rel not in allowed.get(parts[0], ()):
+        return 0, 0, 1
+    target = tree / parts[0] / rel
+    if target.is_file() and target.stat().st_size == m.size:
+        return 0, 0, 0
+    target.parent.mkdir(parents=True, exist_ok=True)
+    part = target.with_name(f".{target.name}.part")
+    try:
+        with tf.extractfile(m) as src, open(part, "wb") as out:
+            shutil.copyfileobj(src, out, 1 << 20)
+        if part.stat().st_size != m.size:
+            raise ValueError(f"{m.name}: {part.stat().st_size} of {m.size} bytes")
+    except BaseException:
+        part.unlink(missing_ok=True)
+        raise
+    os.replace(part, target)
+    return 1, m.size, 0
+
+
 def stream_hd(body, tree: Path, allowed: dict[str, set[str]]) -> tuple[int, int, int]:
-    """Write the HD archive ``body`` (a stream, read once in order) into ``tree``: each member the manifest lists
-    (``allowed``) lands under ``<id>/<file>`` through a temporary file, so nginx never serves half of one; a file
-    already there at the member's size is kept (a retried stream). Anything else is skipped. (written, bytes,
-    skipped)."""
-    written = size = skipped = 0
+    """Write the archive ``body`` (a stream, read once in order) into ``tree``: each member ``allowed`` lists (<id> →
+    paths below it, e.g. model_hd.glb or usd/hd.usdc) lands under ``<id>/<path>`` (``_write_member``); anything else
+    is skipped. (written, bytes, skipped)."""
+    total = [0, 0, 0]
     with tarfile.open(fileobj=body, mode="r|") as tf:
         for m in tf:
-            if m.isdir():
-                continue
-            parts = m.name.removeprefix("./").split("/")
-            if not m.isfile() or len(parts) != 2 or parts[1] not in allowed.get(parts[0], ()):
-                skipped += 1
-                continue
-            target = tree / parts[0] / parts[1]
-            if target.is_file() and target.stat().st_size == m.size:
+            total = [a + b for a, b in zip(total, _write_member(tf, m, tree, allowed))]
+    return total[0], total[1], total[2]
+
+
+def usd_overlay(doc, manifest: dict) -> tuple[dict[str, tuple[str, dict]], int]:
+    """The USD archive's ``usd-manifest.json`` against the served manifest: ({Space key: (entry id, block)} for every
+    well-formed block whose key the manifest lists under the same id, the number left out). Not an overlay at all:
+    ValueError."""
+    if not isinstance(doc, dict) or doc.get("version") != 1 or not isinstance(doc.get("assets"), dict):
+        raise ValueError(f"{USD_OVERLAY} is not a web USD overlay (version 1, assets{{}})")
+    assets = manifest.get("assets") if isinstance(manifest.get("assets"), dict) else {}
+    out, left = {}, 0
+    for key, o in doc["assets"].items():
+        e = assets.get(key)
+        i = o.get("id") if isinstance(o, dict) else None
+        if (isinstance(e, dict) and isinstance(i, str) and SAFE_ID.match(i) and e.get("id") == i
+                and usd_block_ok(o.get("usd"))):
+            out[key] = (i, o["usd"])
+        else:
+            left += 1
+    return out, left
+
+
+def stream_usd(body, tree: Path, manifest: dict) -> tuple[dict[str, tuple[str, dict]], int, int, int, int]:
+    """Write the USD archive ``body`` into ``tree``: its FIRST member must be ``usd-manifest.json`` (else ValueError,
+    nothing written), whose usable blocks (``usd_overlay``) name the only members written — each block's
+    ``usd_tier1_files``. (blocks, left out, written, bytes, skipped)."""
+    blocks, left, total = None, 0, [0, 0, 0]
+    with tarfile.open(fileobj=body, mode="r|") as tf:
+        for m in tf:
+            if blocks is None:
+                if m.name.removeprefix("./") != USD_OVERLAY or not m.isfile() or m.size > USD_OVERLAY_MAX:
+                    raise ValueError(f"the first member is {m.name!r}, not {USD_OVERLAY}")
+                with tf.extractfile(m) as src:
+                    blocks, left = usd_overlay(json.loads(src.read()), manifest)
+                allowed: dict[str, set[str]] = {}
+                for i, block in blocks.values():
+                    allowed.setdefault(i, set()).update(usd_tier1_files(block))
                 continue
-            target.parent.mkdir(parents=True, exist_ok=True)
-            part = target.with_name(f".{target.name}.part")
-            try:
-                with tf.extractfile(m) as src, open(part, "wb") as out:
-                    shutil.copyfileobj(src, out, 1 << 20)
-                if part.stat().st_size != m.size:
-                    raise ValueError(f"{m.name}: {part.stat().st_size} of {m.size} bytes")
-            except BaseException:
-                part.unlink(missing_ok=True)
+            total = [a + b for a, b in zip(total, _write_member(tf, m, tree, allowed))]
+    if blocks is None:
+        raise ValueError(f"an empty archive, no {USD_OVERLAY}")
+    return blocks, left, total[0], total[1], total[2]
+
+
+def landed(tree: Path, entry_id: str, names: set[str]) -> bool:
+    """Every one of ``names`` is a file under ``tree/<entry_id>/``."""
+    return bool(names) and all((tree / entry_id / n).is_file() for n in names)
+
+
+def publish_usd(tree: Path, blocks: dict[str, dict]) -> int:
+    """Rewrite the served manifest with exactly ``blocks`` ({Space key: usd block}) as its entries' ``usd`` (every
+    other block untouched; an entry not in ``blocks`` loses any ``usd``), atomically. The number of entries carrying
+    one. An unchanged manifest is not written."""
+    path = tree / "manifest.json"
+    doc = json.loads(path.read_text())
+    changed = n = 0
+    for key, e in (doc.get("assets") or {}).items():
+        if not isinstance(e, dict):
+            continue
+        if key in blocks:
+            changed += e.get("usd") != blocks[key]
+            e["usd"] = blocks[key]
+            n += 1
+        elif "usd" in e:
+            del e["usd"]
+            changed += 1
+    if changed:
+        part = path.with_name(f".{path.name}.part")
+        part.write_text(json.dumps(doc, separators=(",", ":")))
+        os.replace(part, path)
+    return n
+
+
+def listed_size(cfg: Config, store, uri: str) -> Optional[int]:
+    folder, name = uri.rsplit("/", 1)
+    return next((n for rel, n in store.list_objects(cfg, folder) if rel == name), None)
+
+
+def room_for(tree: Path, size: int, what: str) -> bool:
+    """Never fill the disk OpenSearch and Neo4j write to: a streamed archive is fetched only while ``size`` leaves
+    HD_DISK_MARGIN free. Each archive asks on its own, after the ones before it landed."""
+    free = shutil.disk_usage(tree).free
+    if size + HD_DISK_MARGIN > free:
+        print(f"==> library media {what}: {size / 1e9:.1f} GB would leave under {HD_DISK_MARGIN / 1e9:.0f} GB of "
+              f"{free / 1e9:.1f} GB free — not fetched")
+        return False
+    return True
+
+
+def stream_with_retry(cfg: Config, store, uri: str, what: str, run):
+    """``run(body)`` over the object ``uri`` streamed; a broken stream starts again once (files already complete are
+    kept). None: the object is gone."""
+    for attempt in range(HD_TRIES):
+        body = store.open_stream(cfg, uri)
+        if body is None:
+            print(f"==> library media {what}: none at {uri}")
+            return None
+        try:
+            return run(body)
+        except (OSError, ValueError, tarfile.TarError) as exc:
+            if attempt == HD_TRIES - 1:
                 raise
-            os.replace(part, target)
-            written += 1
-            size += m.size
-    return written, size, skipped
+            print(f"==> library media {what}: stream broke ({type(exc).__name__}: {str(exc)[:200]}), starting again")
+    return None
 
 
 def fetch_hd(cfg: Config, store, uri: str, tree: Path) -> int:
@@ -190,35 +391,100 @@ def fetch_hd(cfg: Config, store, uri: str, tree: Path) -> int:
     allowed = hd_files(json.loads((tree / "manifest.json").read_text()))
     if not allowed:
         return 0
-    folder, name = hd_uri.rsplit("/", 1)
-    size = next((n for rel, n in store.list_objects(cfg, folder) if rel == name), None)
+    size = listed_size(cfg, store, hd_uri)
     if size is None:
         print(f"==> library media HD: none at {hd_uri}")
         return 0
-    free = shutil.disk_usage(tree).free
-    if size + HD_DISK_MARGIN > free:
-        # never fill the disk OpenSearch and Neo4j write to: a smaller Space keeps tier 1
-        print(f"==> library media HD: {size / 1e9:.1f} GB would leave under {HD_DISK_MARGIN / 1e9:.0f} GB of "
-              f"{free / 1e9:.1f} GB free — not fetched")
+    if not room_for(tree, size, "HD"):
+        return 0                                          # a smaller Space keeps tier 1
+    t0 = time.time()
+    got = stream_with_retry(cfg, store, hd_uri, "HD", lambda body: stream_hd(body, tree, allowed))
+    if got is None:
         return 0
+    written, size, skipped = got
+    print(f"==> library media HD: {written} files ({size / 1e6:.0f} MB) from {hd_uri} in {time.time() - t0:.0f} s"
+          + (f"; {skipped} members not in the manifest skipped" if skipped else ""))
+    return written
+
+
+def viewer_format(cfg: Config) -> str:
+    """The Space's VIEWER_FORMAT as supervisord.conf renders it into /config.js: glb | usd | auto, anything else glb."""
+    value = cfg.get("VIEWER_FORMAT", "")
+    return value if value in VIEWER_FORMATS else "glb"
+
+
+def fetch_usd(cfg: Config, store, uri: str, tree: Path) -> int:
+    """Web USD (see the module doc): stream ``uri``'s ``.usd.tar`` sibling into the installed ``tree`` and publish the
+    blocks whose tier-1 files landed (without their full level), then its ``.usdhd.tar`` and give back the full level
+    of the blocks whose files landed. Returns the number of entries the served manifest then gives a ``usd``. Off
+    unless VIEWER_FORMAT is usd or auto; each archive only with room to spare (``room_for``)."""
+    fmt = viewer_format(cfg)
+    if fmt == "glb":
+        print("==> library media USD: off (VIEWER_FORMAT glb)")
+        return 0
+    if cfg.get("LIBRARY_MEDIA_USD", "").strip().lower() in DISABLED:
+        print("==> library media USD: off (LIBRARY_MEDIA_USD)")
+        return 0
+    base = uri[: -len(".tar")]
+    usd_uri = base + USD_SUFFIX
+    size = listed_size(cfg, store, usd_uri)
+    if size is None:
+        print(f"==> library media USD: none at {usd_uri}")
+        return 0
+    if not room_for(tree, size, "USD"):
+        return 0
+    manifest = json.loads((tree / "manifest.json").read_text())
     t0 = time.time()
-    total = [0, 0, 0]
-    for attempt in range(HD_TRIES):
-        body = store.open_stream(cfg, hd_uri)
-        if body is None:
-            print(f"==> library media HD: none at {hd_uri}")
-            return 0
-        try:
-            written, size, skipped = stream_hd(body, tree, allowed)
-            total = [total[0] + written, total[1] + size, skipped]
-            break
-        except (OSError, ValueError, tarfile.TarError) as exc:
-            if attempt == HD_TRIES - 1:
-                raise
-            print(f"==> library media HD: stream broke ({type(exc).__name__}: {str(exc)[:200]}), starting again")
-    print(f"==> library media HD: {total[0]} files ({total[1] / 1e6:.0f} MB) from {hd_uri} in {time.time() - t0:.0f} s"
-          + (f"; {total[2]} members not in the manifest skipped" if total[2] else ""))
-    return total[0]
+    got = stream_with_retry(cfg, store, usd_uri, "USD", lambda body: stream_usd(body, tree, manifest))
+    del manifest
+    if got is None:
+        return 0
+    blocks, left, written, nbytes, skipped = got
+    tier1 = {k: usd_without_hd(b) for k, (i, b) in blocks.items() if landed(tree, i, usd_tier1_files(b))}
+    shown = publish_usd(tree, tier1)
+    print(f"==> library media USD: {shown} of {len(blocks)} blocks served at tier 1 ({written} files, "
+          f"{nbytes / 1e6:.0f} MB) from {usd_uri} in {time.time() - t0:.0f} s"
+          + (f"; {left} blocks not in this manifest (or malformed) left out" if left else "")
+          + (f"; {skipped} members not listed skipped" if skipped else ""))
+    full = {k: (i, b) for k, (i, b) in blocks.items() if k in tier1 and usd_hd_files(b)}
+    if not full:
+        return shown
+    try:
+        landed_hd = fetch_usd_hd(cfg, store, base + USD_HD_SUFFIX, tree, full)
+    except Exception as exc:  # noqa: BLE001 — tier 1 is served already; the full level is a bonus
+        print(f"==> library media USD HD: stopped ({type(exc).__name__}: {str(exc)[:300]}) — USD tier 1 stays",
+              file=sys.stderr)
+        return shown
+    if landed_hd:
+        publish_usd(tree, {**tier1, **{k: blocks[k][1] for k in landed_hd}})
+    return shown
+
+
+def fetch_usd_hd(cfg: Config, store, uri: str, tree: Path, blocks: dict[str, tuple[str, dict]]) -> set[str]:
+    """Stream the ``.usdhd.tar`` ``uri`` into ``tree`` (only ``blocks``' ``usd_hd_files``); the Space keys whose
+    full-level files are all there. Off (LIBRARY_MEDIA_USD_HD), absent or without room: none."""
+    if cfg.get("LIBRARY_MEDIA_USD_HD", "").strip().lower() in DISABLED:
+        print("==> library media USD HD: off (LIBRARY_MEDIA_USD_HD) — USD tier 1 only")
+        return set()
+    size = listed_size(cfg, store, uri)
+    if size is None:
+        print(f"==> library media USD HD: none at {uri} — USD tier 1 only")
+        return set()
+    if not room_for(tree, size, "USD HD"):
+        return set()
+    allowed: dict[str, set[str]] = {}
+    for i, block in blocks.values():
+        allowed.setdefault(i, set()).update(usd_hd_files(block))
+    t0 = time.time()
+    got = stream_with_retry(cfg, store, uri, "USD HD", lambda body: stream_hd(body, tree, allowed))
+    if got is None:
+        return set()
+    written, nbytes, skipped = got
+    keys = {k for k, (i, b) in blocks.items() if landed(tree, i, usd_hd_files(b))}
+    print(f"==> library media USD HD: {len(keys)} of {len(blocks)} blocks with their full level ({written} files, "
+          f"{nbytes / 1e6:.0f} MB) from {uri} in {time.time() - t0:.0f} s"
+          + (f"; {skipped} members not listed skipped" if skipped else ""))
+    return keys
 
 
 def fetch(env: dict[str, str], root: Path = MEDIA_ROOT, store=None) -> int:
@@ -253,6 +519,9 @@ def fetch(env: dict[str, str], root: Path = MEDIA_ROOT, store=None) -> int:
         if count is None:
             print(f"==> library media: {uri} has no usable manifest.json — none served")
             return 0
+        if '"usd"' in (tmp / "tree" / "manifest.json").read_text():
+            # web USD comes only from its own archives (fetch_usd), never from this one's manifest
+            publish_usd(tmp / "tree", {})
         install(tmp / "tree", root / INDEX_KEY)
     finally:
         shutil.rmtree(tmp, ignore_errors=True)
@@ -262,6 +531,11 @@ def fetch(env: dict[str, str], root: Path = MEDIA_ROOT, store=None) -> int:
         fetch_hd(cfg, store, uri, root / INDEX_KEY)
     except Exception as exc:  # noqa: BLE001 — the tier-1 tree is served already; HD is a bonus
         print(f"==> library media HD: stopped ({type(exc).__name__}: {str(exc)[:300]}) — tier 1 stays", file=sys.stderr)
+    try:
+        fetch_usd(cfg, store, uri, root / INDEX_KEY)
+    except Exception as exc:  # noqa: BLE001 — the GLB tiers are served already; web USD is a bonus
+        print(f"==> library media USD: stopped ({type(exc).__name__}: {str(exc)[:300]}) — the GLB stays",
+              file=sys.stderr)
     return count
 
 

services/explorer/dist/build-info.json

@@ -1,7 +1,7 @@
 {
   "product": "simready-central-slim-explorer",
-  "version": "slim-ui-b62bb449",
-  "bundle_id": "main.9cf56290.js",
-  "built_at": "2026-10-15T05:56:39Z",
+  "version": "slim-ui-6262a66a",
+  "bundle_id": "main.cf692f87.js",
+  "built_at": "2026-10-15T08:41:49Z",
   "flags": {"public_mode": true, "email_auth": false, "create_ui": false, "hierarchy_editor": false, "create_search": false, "auth_ui": false, "credentials_ui": false, "index_management": false, "inference_backend": "hub", "vlm_asset_refs": false, "validation_image_max_px": 448, "validation_max_retries": 0, "validation_max_concurrent": 32, "validation_tail_concurrent": 8, "validation_eager_count": 50, "validation_batch_stream": true, "library_idle_prefetch": false, "validation_score_scale": "percent", "parse_gate_fields": true, "parse_fast_path": true, "featured_landing": true, "dependency_views": true, "model_viewer": false, "library_viewer": true, "library_media": "runtime", "spell_correction": false, "downloads": "runtime", "submit_content": "runtime", "third_party_notices": "runtime"}
 }

services/explorer/dist/index.html

@@ -1 +1 @@
-<!doctype html><html lang="en"><head><meta charset="utf-8"/><link rel="icon" href="/ds.png"/><meta name="viewport" content="width=device-width,initial-scale=1"/><meta name="theme-color" content="#000000"/><meta name="description" content="SimReady Central — SimReady asset search"/><meta name="ui-version" content="slim-ui-b62bb449"><script src="/config.js"></script><title>SimReady Central</title><script defer="defer" src="/static/js/main.9cf56290.js"></script><link href="/static/css/main.01671ca7.css" rel="stylesheet"></head><body><noscript>You need to enable JavaScript to run this app.</noscript><div id="root"></div></body></html>
+<!doctype html><html lang="en"><head><meta charset="utf-8"/><link rel="icon" href="/ds.png"/><meta name="viewport" content="width=device-width,initial-scale=1"/><meta name="theme-color" content="#000000"/><meta name="description" content="SimReady Central — SimReady asset search"/><meta name="ui-version" content="slim-ui-6262a66a"><script src="/config.js"></script><title>SimReady Central</title><script defer="defer" src="/static/js/main.cf692f87.js"></script><link href="/static/css/main.01671ca7.css" rel="stylesheet"></head><body><noscript>You need to enable JavaScript to run this app.</noscript><div id="root"></div></body></html>

services/explorer/dist/static/js/9.a9ea1e41.chunk.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkdeepsearch_ui=self.webpackChunkdeepsearch_ui||[]).push([[9],{9(e,t,o){o.r(t),o.d(t,{COLLIDERS_LAYER:()=>c,HD_LAYER:()=>i,LOCAL:()=>p,NORMAL_MODES:()=>N,READER_TEXTURES:()=>h,RECYCLE_BYTES:()=>m,ROOT_KEY:()=>u,ROOT_LAYER:()=>l,SLOTS:()=>k,WARM_KEY:()=>d,WebUsdError:()=>f,_readerState:()=>Me,_resetWebUsdReader:()=>ye,colorSpaceOf:()=>C,compactRecord:()=>I,expected:()=>ge,fallbackWarning:()=>Z,fileKey:()=>x,flipV:()=>T,geometryArrays:()=>Y,isWebUsdError:()=>v,loadWebUsd:()=>be,lowBitLog2:()=>W,mapUrl:()=>U,materialGaps:()=>ee,materialParams:()=>$,openpbrOnly:()=>J,pieceOf:()=>M,planHints:()=>_,quantizeLattice:()=>D,roleOf:()=>E,rootLayerText:()=>S,setWebUsdReader:()=>ae,siblingUrl:()=>A,snormNormals:()=>G,tierLayers:()=>L,uvDequant:()=>F,uvMatrix:()=>q,warmWebUsdReader:()=>fe,webUsdReaderFailure:()=>b,webUsdReaderSet:()=>le});var n=o(986),r=o(379),s=o(1);const a=["warnings"],l="asset.usdc",i="hd.usdc",c="colliders.usdc",u="simready-web.usda",d="simready-warm.usda",p="local:///",m=268435456,h="none";class f extends Error{constructor(e,t){let{cause:o,url:n,status:r,fatal:s}=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};super(t),this.name="WebUsdError",this.code=e,void 0!==o&&(this.cause=o),void 0!==n&&(this.url=n),void 0!==r&&(this.status=r),s&&(this.fatal=!0)}}const v=e=>e instanceof f;let g=null;function w(e,t){let o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};return g=new f(e,t,(0,r.A)((0,r.A)({},o),{},{fatal:!0})),g}const b=()=>g,y=/\/Bodies\/(b\d+)\/(?:lo|hd)\/(m\d+)$/;function M(e){const t=y.exec(e||"");return t?{body:t[1],name:t[1]+t[2]}:null}function S(){const e=2===(arguments.length>0&&void 0!==arguments[0]?arguments[0]:1)?"full":"preview";return["#usda 1.0","(",'    defaultPrim = "Asset"',"    metersPerUnit = 1",'    upAxis = "Y"',"    subLayers = [","        @./".concat(l,"@"),"    ]",")","",'over "Asset" (',"    variants = {",'        string lod = "'.concat(e,'"'),'        string textures = "web"',"    }",")","{","}",""].join("\n")}const L=function(){return 2===(arguments.length>0&&void 0!==arguments[0]?arguments[0]:1)?[l,i]:[l]},x=e=>String(e).split(/[?#]/)[0];function A(e,t){const o=new URL(e,t);return o.search||(o.search=new URL(t).search),o.href}function U(e,t){return String(e).startsWith(p)?A(String(e).slice(p.length).replace(/^\/+/,""),t):new URL(e,t).href}function _(e,t){const o=new Map;for(const n of e||[]){if("string"!==typeof n||!n.trim())continue;const e=A(n.trim(),t),r=x(e);o.has(r)||o.set(r,e)}return o}const k={diffuseColor:"map",emissiveColor:"emissiveMap",roughness:"roughnessMap",metallic:"metalnessMap",occlusion:"aoMap",opacity:"alphaMap",normal:"normalMap"},R={map:"rgb",emissiveMap:"rgb",roughnessMap:"g",metalnessMap:"b",aoMap:"r",alphaMap:"g",normalMap:"rgb"},B=new Set(["map","emissiveMap","sheenColorMap","specularColorMap"]),E=e=>B.has(e)?"color":"data",C=e=>"color"===e?"srgb":"",O=(e,t)=>Math.abs(e-t)<1e-6,P={r:0,g:1,b:2,a:3};function T(e){for(let t=1;t<e.length;t+=2)e[t]=1-e[t];return e}function I(e,t){var o,n;if(!0===e)return!0;if(Array.isArray(e))return 3===e.length&&e.every(e=>Number.isInteger(e)&&e>0);if(e&&"object"===typeof e)return!!e.bits||Number.isInteger(e.points_log2);let r=null===t||void 0===t||null===(o=t.customLayerData)||void 0===o||null===(n=o.simready)||void 0===n?void 0:n.tiers;if("string"===typeof r)try{r=JSON.parse(r)}catch(s){r=null}return!(!r||"object"!==typeof r||!r.compact)}function W(e){const t=new Uint32Array(e.buffer,e.byteOffset,e.length);let o=1/0;for(let n=0;n<t.length;n+=1){const e=t[n];if(0===(2147483647&e)){if(0!==e)return null;continue}const r=e>>>23&255;if(255===r)return null;const s=r?8388607&e|8388608:8388607&e,a=(r||1)-150+(31-Math.clz32(s&-s));a<o&&(o=a)}return o===1/0?0:o}const j=[-32768,32767],z=[0,65535];function D(e,t){let o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:t;const n=e.length/t;if(!(n>0)||!Number.isInteger(n))return null;const r=W(e);if(null===r)return null;const s=2**-r,a=new Array(t).fill(1/0),l=new Array(t).fill(-1/0);for(let m=0,h=0;m<n;m+=1)for(let o=0;o<t;o+=1,h+=1){const t=e[h]*s;t<a[o]&&(a[o]=t),t>l[o]&&(l[o]=t)}const i=Math.min(...a),c=Math.max(...l);let u=null,d=new Array(t).fill(0);if(i>=j[0]&&c<=j[1])u=Int16Array;else if(i>=z[0]&&c<=z[1])u=Uint16Array;else{if(!a.every((e,t)=>l[t]-e<=z[1]))return null;u=Uint16Array,d=a.slice()}const p=new u(n*o);for(let m=0,h=0;m<n;m+=1)for(let n=0;n<t;n+=1,h+=1)p[m*o+n]=e[h]*s-d[n];return{array:p,k:r,offset:d,min:a.map((e,t)=>e-d[t]),max:l.map((e,t)=>e-d[t])}}function G(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:8;const o=16===t?Int16Array:Int8Array,n=16===t?32767:127,r=e.length/3,s=new o(4*r);for(let a=0;a<r;a+=1)for(let t=0;t<3;t+=1){const o=Math.max(-1,Math.min(1,e[3*a+t]||0));s[4*a+t]=Math.sign(o)*Math.floor(Math.abs(o)*n+.5)}return s}const F=e=>{let{k:t,offset:o}=e;const n=2**t;return[n,0,o[0]*n,0,n,o[1]*n,0,0,1].map(e=>e+0)},N={int8:8,int16:16,float:0};function Y(e,t){let o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"int8";const n=(e.uvs||[]).map(T),r=e=>e?(e.array||e).byteLength:0,s=r(e.positions)+r(e.normals)+n.reduce((e,t)=>e+t.byteLength,0),a={position:e.positions,normal:e.normals,uvs:n.slice(),positionLattice:null,uvLattice:null};if(t){var l;a.positionLattice=D(e.positions,3,4),a.positionLattice&&(a.position=a.positionLattice);const t=null!==(l=N[o])&&void 0!==l?l:8;t&&e.normals&&(a.normal={array:G(e.normals,t),bits:t}),n[0]&&(a.uvLattice=D(n[0],2,2),a.uvLattice&&(a.uvs[0]=a.uvLattice))}return a.bytes={float:s,upload:r(a.position)+r(a.normal)+a.uvs.reduce((e,t)=>e+r(t),0)},a}const H=(e,t)=>[0,1,2].flatMap(o=>[0,1,2].map(n=>e[3*o]*t[n]+e[3*o+1]*t[3+n]+e[3*o+2]*t[6+n])),K=[1,0,0,0,-1,1,0,0,1];function q(e){const[t,o]=(null===e||void 0===e?void 0:e.uvScale)||[1,1],[n,r]=(null===e||void 0===e?void 0:e.uvTranslation)||[0,0],s=((null===e||void 0===e?void 0:e.uvRotation)||0)*Math.PI/180;if(1===t&&1===o&&0===n&&0===r&&0===s)return null;const a=Math.cos(s),l=Math.sin(s);return H(H(K,[a*t,-l*o,n,l*t,a*o,r,0,0,1]),K).map(e=>e+0)}const V={mirror:"mirror",clamp:"clamp",black:"clamp"},X={specular_weight:"specularIntensity",specular_color:"specularColor",specular_ior:"ior",transmission_weight:"transmission",transmission_color:"attenuationColor",transmission_depth:"attenuationDistance",coat_weight:"clearcoat",coat_roughness:"clearcoatRoughness",fuzz_color:"sheenColor",fuzz_roughness:"sheenRoughness",specular_roughness_anisotropy:"anisotropy"},Q={base_weight:1,base_color:[.8,.8,.8],base_metalness:0,specular_roughness:.3,geometry_opacity:1,emission_color:[1,1,1]},J=e=>"fallback"===(null===e||void 0===e?void 0:e.kind)&&!(null===e||void 0===e||!e.openpbr);function $(e){var t,o,n,r;const s=e&&e.openpbr||{},a=e&&e.simready||{},l=e&&e.maps||{},i={name:(null===e||void 0===e?void 0:e.path)||"",color:[...(null===e||void 0===e?void 0:e.color)||[1,1,1]],opacity:null!==(t=null===e||void 0===e?void 0:e.opacity)&&void 0!==t?t:1,roughness:null!==(o=null===e||void 0===e?void 0:e.roughness)&&void 0!==o?o:1,metalness:null!==(n=null===e||void 0===e?void 0:e.metallic)&&void 0!==n?n:1,emissive:[...(null===e||void 0===e?void 0:e.emissive)||[0,0,0]],emissiveIntensity:1,alphaMode:"OPAQUE",alphaTest:0,transparent:!1,depthWrite:!0,doubleSided:null,normalScale:1,aoMapIntensity:1,physical:{},maps:{},gaps:[]},c=(e,t)=>{i.maps[e]={path:t.path,role:E(e),wrap:[V[t.wrapS]||"repeat",V[t.wrapT]||"repeat"],matrix:q(t)};const o=R[e];o&&t.channel!==o&&i.gaps.push("".concat(e," reads ").concat(t.channel,", three samples ").concat(o))},u=e=>e.channel in P?e.scale[P[e.channel]]:e.scale[0],d=l.diffuseColor;let p=!1;for(const[v,g]of Object.entries(l)){const t=k[v];t&&g&&g.path?(g.uvSet&&"st"!==g.uvSet&&i.gaps.push("".concat(v," samples primvar ").concat(g.uvSet,", not st")),"diffuseColor"===v?(i.color=[0,1,2].map(t=>{var o,n;return(null!==(o=null===(n=e.color)||void 0===n?void 0:n[t])&&void 0!==o?o:1)*g.scale[t]}),c(t,g)):"emissiveColor"===v?(i.emissive=[0,1,2].map(e=>g.scale[e]),c(t,g)):"roughness"===v?(i.roughness=u(g),c(t,g)):"metallic"===v?(i.metalness=u(g),c(t,g)):"occlusion"===v?(i.aoMapIntensity=u(g),c(t,g)):"normal"===v?(O(g.scale[0],2)&&O(g.bias[0],-1)||i.gaps.push("normal map not at scale 2 / bias -1"),c(t,g)):"opacity"===v&&(p=!0,i.opacity=u(g),d&&d.path===g.path&&"a"===g.channel||c(t,g)),"normal"!==v&&"occlusion"!==v&&g.bias&&g.bias.some(e=>!O(e,0))&&i.gaps.push("".concat(v," has a bias"))):i.gaps.push("".concat(v,": no three.js map"))}const m=J(e),h=new Set(e&&e.openpbrTextured||[]);if(m){const t=(e,t)=>t(s[e])?s[e]:Q[e],o=e=>"number"===typeof e,n=e=>Array.isArray(e)&&3===e.length,r=t("base_weight",o);i.color=t("base_color",n).map(e=>e*r),i.metalness=t("base_metalness",o),i.roughness=t("specular_roughness",o),i.opacity=t("geometry_opacity",o);const a=void 0!==s.emission_color||s.emission_luminance>0;i.emissive=a?[...t("emission_color",n)]:[0,0,0],p=h.has("geometry_opacity");for(const e of h)Object.hasOwn(Q,e)&&i.gaps.push("".concat(e,": its map is not read (factor only)"));"number"===typeof e.normalScale&&i.gaps.push("geometry_normal: its map is not read")}i.alphaMode=a.alphaMode||((null===e||void 0===e?void 0:e.opacityThreshold)>0?"MASK":p||i.opacity<1?"BLEND":"OPAQUE"),"MASK"===i.alphaMode&&(i.alphaTest=null!==(r=a.alphaCutoff)&&void 0!==r?r:(null===e||void 0===e?void 0:e.opacityThreshold)>0?e.opacityThreshold:.5),"BLEND"===i.alphaMode&&(i.transparent=!0,i.depthWrite=!1),"boolean"===typeof a.doubleSided&&(i.doubleSided=a.doubleSided),"number"===typeof(null===e||void 0===e?void 0:e.normalScale)&&(i.normalScale=e.normalScale),"number"===typeof a.occlusionStrength&&(i.aoMapIntensity=a.occlusionStrength);for(const[v,g]of Object.entries(X))void 0!==s[v]&&(i.physical[g]=s[v]);for(const v of h)X[v]&&i.gaps.push("".concat(v,": its map is not read (factor only)"));s.fuzz_weight>0&&(i.physical.sheen=1),"number"===typeof a.thickness&&(i.physical.thickness=a.thickness),s.geometry_thin_walled&&(i.physical.thickness=0),"number"===typeof a.anisotropyRotation&&(i.physical.anisotropyRotation=a.anisotropyRotation);const f=s.emission_luminance;return"number"===typeof f&&f>0&&(i.emissiveIntensity=f,m||(i.emissive=i.emissive.map(e=>e/f))),i}function Z(e){const t=(e||[]).filter(e=>"fallback"===(null===e||void 0===e?void 0:e.kind)&&e.path&&!J(e));return t.length?{code:"material-fallback",path:t[0].path,message:"".concat(t.length," material(s) have no ")+"UsdPreviewSurface, OpenPBR surface or supported MDL material and show as grey"}:null}function ee(e){var t;const o=[];return null!==e&&void 0!==e&&e.openpbr||o.push("openpbr: specular weight/colour, ior, transmission, coat, fuzz, anisotropy, emission luminance"),null!==e&&void 0!==e&&e.simready||o.push("simready: alphaMode, alphaCutoff, doubleSided, occlusionStrength, thickness, anisotropyRotation"),"number"!==typeof(null===e||void 0===e?void 0:e.normalScale)&&null!==e&&void 0!==e&&null!==(t=e.maps)&&void 0!==t&&t.normal&&o.push("normal scale"),o}let te=null,oe=null,ne=null,re=null,se=0;function ae(e){re&&ue(re),re=null,oe=null,ne=null,te=e||null}const le=()=>!!te;function ie(){if(!te)return Promise.reject(new f("reader","webUsdLoader: no reader set"));if(!oe){const e=performance.now(),t=te,o=Promise.resolve().then(()=>t.compile?t.compile():async function(e){const t=await fetch(e);if(!t.ok)throw new Error("HTTP ".concat(t.status));const o=await t.arrayBuffer();if(!(0,s.Hr)(o))throw new Error("not WebAssembly (a page served in its place?)");return WebAssembly.compile(o)}(t.wasmUrl)).then(t=>(ne=performance.now()-e,t)).catch(e=>{throw w("reader","webUsdLoader: could not compile the reader's WASM: ".concat((null===e||void 0===e?void 0:e.message)||e),{cause:e,url:t.wasmUrl&&String(t.wasmUrl)})});o.catch(()=>{oe===o&&(oe=null)}),oe=o}return oe}function ce(){let e;try{e=te.createWorker?te.createWorker():new Worker(te.workerUrl,{type:"module"})}catch(t){throw w("reader","webUsdLoader: could not start the reader's worker: ".concat((null===t||void 0===t?void 0:t.message)||t),{cause:t})}return se+=1,{worker:e,dead:!1,ready:Promise.resolve(!0)}}function ue(e){e&&!e.dead&&(e.dead=!0,e.worker.onmessage=null,e.worker.onerror=null,e.worker.terminate())}const de={fetch:"fetch",compose:"compose",aborted:"aborted",worker:"reader"};function pe(e,t,o,n){let r=arguments.length>4&&void 0!==arguments[4]?arguments[4]:{};return new Promise((s,a)=>{const{worker:l}=e;let i=0,c=!1;r.posted=!1;const u=t=>{c||(c=!0,null===n||void 0===n||n.removeEventListener("abort",d),l.onmessage=null,l.onerror=null,t?(r.posted&&ue(e),a(t)):s(i))};function d(){u(new f("aborted","webUsdLoader: the load was aborted",{url:t.url}))}if(null!==n&&void 0!==n&&n.aborted)d();else{null===n||void 0===n||n.addEventListener("abort",d,{once:!0}),l.onmessage=e=>{var t,n,r;let{data:s}=e;if(!c&&s)if("texture"===s.type&&(null===(t=s.bitmap)||void 0===t||null===(n=t.close)||void 0===n||n.call(t)),"scene"===s.type&&(i=(null===(r=s.stats)||void 0===r?void 0:r.wasmMemoryBytes)||0),"done"!==s.type)if("error"!==s.type)try{o(s)}catch(a){u(v(a)?a:new f("compose","webUsdLoader: could not build the scene: ".concat((null===a||void 0===a?void 0:a.message)||a),{cause:a}))}else u(new f(de[s.code]||"compose","webUsdLoader: ".concat(s.message),{url:s.url,status:s.status}));else u(null)},l.onerror=e=>{var t;null===e||void 0===e||null===(t=e.preventDefault)||void 0===t||t.call(e),u(w("reader","webUsdLoader: the reader's worker failed: ".concat((null===e||void 0===e?void 0:e.message)||"error")))};try{l.postMessage(t),r.posted=!0}catch(p){u(new f("reader","webUsdLoader: could not post to the reader's worker: ".concat((null===p||void 0===p?void 0:p.message)||p),{cause:p}))}}})}function me(e,t){e.dead||(re||t>m?ue(e):re=e)}let he=null;function fe(){if(!te)return Promise.resolve(!1);if(re){const e=re;return e.ready.then(t=>t&&!e.dead)}if(he)return he;const e=ie().then(e=>{if(re)return re.ready;const t=ce();return t.ready=pe(t,(e=>({url:p+d,wasmModule:e,textures:h,files:new Map([[d,new Blob(['#usda 1.0\n(\n    defaultPrim = "Asset"\n)\n\ndef Xform "Asset"\n{\n}\n'],{type:"text/plain"})]])}))(e),()=>{}).then(()=>!0,()=>(re===t&&(re=null),ue(t),!1)),re=t,t.ready}).catch(()=>!1).finally(()=>{he===e&&(he=null)});return he=e,e}function ve(e){let{ktx2:t,fetchFn:o,headers:n,signal:r,t0:s}=e;const a=new Map;let l=null;const i=(e,i)=>{const c=x(e);if(a.has(c))return a.get(c);const u={url:e,hinted:i,used:!1,startMs:performance.now()-s,readyMs:null,texture:null,error:null,derived:new Map};return u.promise=Promise.all([(l||(l=Promise.resolve("function"===typeof t?t():t).then(e=>{if(!e)throw new f("textures","webUsdLoader: maps need the page's KTX2 loader");return e})),l),Promise.resolve(o(e,{signal:r,headers:n,credentials:"same-origin"})).then(t=>{if(!t.ok)throw new f("textures","webUsdLoader: map ".concat(e,": HTTP ").concat(t.status),{url:e,status:t.status});return t.arrayBuffer()})]).then(e=>{let[t,o]=e;return((e,t)=>new Promise((o,n)=>e.parse(t,o,n)))(t,o)}).then(e=>(u.texture=e,u.readyMs=performance.now()-s,e)).catch(t=>{throw u.error=v(t)?t:new f(null!==r&&void 0!==r&&r.aborted?"aborted":"textures","webUsdLoader: map ".concat(e,": ").concat((null===t||void 0===t?void 0:t.message)||t),{cause:t,url:e}),u.error}),u.promise.catch(()=>{}),a.set(c,u),u};return{files:a,start:i,use(e){const t=i(e,!1);return t.used=!0,t},settle:()=>Promise.all([...a.values()].filter(e=>e.used).map(e=>e.promise)),texture(e,t,o,n,r){const s=a.get(x(t)),l=s.texture,i="color"===o?e.SRGBColorSpace:e.NoColorSpace,c=t=>"mirror"===t?e.MirroredRepeatWrapping:"clamp"===t?e.ClampToEdgeWrapping:e.RepeatWrapping,u="".concat(i,"|").concat(n.join(","),"|").concat(r?r.join(","):"");if(s.derived.size||(l.flipY=!1,l.colorSpace=i,l.magFilter=e.LinearFilter,l.minFilter=e.LinearMipmapLinearFilter,l.wrapS=c(n[0]),l.wrapT=c(n[1]),r&&(l.matrixAutoUpdate=!1,l.matrix.set(...r)),l.needsUpdate=!0,s.derived.set(u,l)),!s.derived.has(u)){const e=l.clone();e.colorSpace=i,e.wrapS=c(n[0]),e.wrapT=c(n[1]),e.matrixAutoUpdate=!r,r?e.matrix.set(...r):e.matrix.identity(),e.needsUpdate=!0,s.derived.set(u,e)}return s.derived.get(u)},all:()=>[...a.values()].flatMap(e=>[...e.derived.values()]),unused:()=>[...a.values()].filter(e=>!e.used&&e.texture).map(e=>e.texture)}}const ge=e=>"".concat((null===e||void 0===e?void 0:e.path)||""," ").concat((null===e||void 0===e?void 0:e.message)||"").includes(c);function we(e,t){let{maps:o,base:r,tier:s,compact:l=null,normals:i="int8"}=t;const c=new e.Group;c.name="usd";const u=new Map,d=[],p=new Map,m=[],h=[];let f=null,v=[],g=new Map,w=!1;const b={meshes:0,triangles:0,loose:0},y={compact:!1,geometries:0,position:0,normal:0,uv:0,floatBytes:0,uploadBytes:0,ms:0},S=t=>{if(!u.has(t)){const o=new e.Group;o.name=t,u.set(t,o),c.add(o)}return u.get(t)},L=function(t,o,n){let s=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null;const a=v[t],l=s&&Object.keys(a.maps).length?s.join(","):"",i="".concat(t,"|").concat(o,"|").concat(n,"|").concat(l);if(!p.has(i)){const t=function(e,t,o){var n;let r=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];const s=new e.MeshPhysicalMaterial;s.name=t.name,s.color.setRGB(t.color[0],t.color[1],t.color[2],e.LinearSRGBColorSpace),s.opacity=t.opacity,s.roughness=t.roughness,s.metalness=t.metalness,s.emissive.setRGB(t.emissive[0],t.emissive[1],t.emissive[2],e.LinearSRGBColorSpace),s.emissiveIntensity=t.emissiveIntensity,s.transparent=t.transparent,s.depthWrite=t.depthWrite,s.alphaTest=t.alphaTest,s.side=(null!==(n=t.doubleSided)&&void 0!==n?n:o)?e.DoubleSide:e.FrontSide,s.normalScale.set(t.normalScale,r?-t.normalScale:t.normalScale),r&&(s.clearcoatNormalScale.y*=-1),s.aoMapIntensity=t.aoMapIntensity;for(const[l,i]of Object.entries(t.physical)){var a;null!==(a=s[l])&&void 0!==a&&a.isColor&&Array.isArray(i)?s[l].setRGB(i[0],i[1],i[2],e.LinearSRGBColorSpace):"number"===typeof i&&(s[l]=i)}return s}(e,a,o,n);for(const[e,o]of Object.entries(a.maps)){const n=l?o.matrix?H(o.matrix,s).map(e=>e+0):s:o.matrix;m.push([t,e,U(o.path,r),o.role,o.wrap,n])}p.set(i,t)}return p.get(i)};let x=null;return{root:c,bodies:u,geometries:d,materials:p,warnings:h,receive:t=>{if("meta"===t.type)(e=>{f=e.meta,w=I(l,f),y.compact=w,v=(f.materials||[]).map($);for(const t of v){for(const e of t.gaps)h.push({code:"material",message:"".concat(t.name,": ").concat(e)});for(const e of Object.values(t.maps))o.use(U(e.path,r))}g=new Map;for(const t of f.instances||[]){const e=M(t.path);e&&S(e.body),g.has(t.geometry)||g.set(t.geometry,[]),g.get(t.geometry).push(t)}for(const t of f.warnings||[])if("material-fallback"===t.code){const e=Z(f.materials);e&&h.push(e)}else ge(t)||h.push(t)})(t);else if("geometry"===t.type)(t=>{var o;let{index:n,meta:r,arrays:s}=t;if(!r)return;if(!s)throw new Error("a geometry without its arrays");const a=new e.BufferGeometry,l=performance.now(),u=Y(s,w,i);y.ms+=performance.now()-l;const p=u.positionLattice;let m=null;if(p){a.setAttribute("position",new e.InterleavedBufferAttribute(new e.InterleavedBuffer(p.array,4),3,0,!1));const t=2**p.k;m=(new e.Matrix4).makeScale(t,t,t).setPosition(p.offset[0]*t,p.offset[1]*t,p.offset[2]*t),a.boundingBox=new e.Box3(new e.Vector3(...p.min),new e.Vector3(...p.max))}else a.setAttribute("position",new e.BufferAttribute(u.position,3)),a.boundingBox=(new e.Box3).setFromArray(r.bounds);null!==(o=u.normal)&&void 0!==o&&o.bits?a.setAttribute("normal",new e.InterleavedBufferAttribute(new e.InterleavedBuffer(u.normal.array,4),3,0,!0)):u.normal&&a.setAttribute("normal",new e.BufferAttribute(u.normal,3)),u.uvs.forEach((t,o)=>a.setAttribute(o?"uv".concat(o):"uv",new e.BufferAttribute(t.array||t,2,!1)));const f=u.uvLattice?F(u.uvLattice):null;var v;a.setIndex(new e.BufferAttribute(s.indices,1)),a.boundingSphere=a.boundingBox.getBoundingSphere(new e.Sphere),w&&(y.geometries+=1,y.position+=p?1:0,y.normal+=null!==(v=u.normal)&&void 0!==v&&v.bits?1:0,y.uv+=f?1:0),y.floatBytes+=u.bytes.float,y.uploadBytes+=u.bytes.upload,r.groups.length>1&&r.groups.forEach((e,t)=>{let[o,n]=e;return a.addGroup(o,n,t)}),r.hasColors&&h.push({code:"vertex-colors",message:"geometry ".concat(n,": vertex colours ignored")}),d.push(a);const x=r.groups.reduce((e,t)=>{let[,o]=t;return e+o/3},0),A=void 0===a.attributes.tangent;for(const i of g.get(n)||[]){const t=r.groups.map(e=>{let[,,t]=e;return L(void 0!==t&&Object.hasOwn(i.subsets||{},t)?i.subsets[t]:i.material,!!i.doubleSided,A,f)}),o=new e.Mesh(a,t.length>1?t:t[0]),n=M(i.path);o.name=n?n.name:i.path.split("/").pop(),o.matrix.fromArray(i.matrix),m&&o.matrix.multiply(m),o.matrix.decompose(o.position,o.quaternion,o.scale),n?S(n.body).add(o):(b.loose+=1,c.add(o)),b.meshes+=1,b.triangles+=x}})(t);else if("scene"===t.type){const e=t.stats||{},{warnings:o}=e,r=(0,n.A)(e,a);x=r;for(const t of o||[])ge(t)||h.push(t)}},attachMaps:()=>{for(const[t,n,r,s,a,l]of m)t[n]=o.texture(e,r,s,a,l);for(const e of p.values())e.needsUpdate=!0},counts:b,attrs:y,stats:()=>x,meta:()=>f,tier:s}}async function be(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const{tier:n=1,ktx2:s=null,ktx2Hint:a=null,signal:i=null,headers:c,onStage:d=null,compact:m=null,normals:g="int8"}=t,w=t.fetchFn||function(){return fetch(...arguments)},b=performance.now(),y={},M=e=>{y[e]=Math.round(10*(performance.now()-b))/10,null===d||void 0===d||d(e,y[e])};if(!te)throw new f("reader","webUsdLoader: no reader set");if(null!==i&&void 0!==i&&i.aborted)throw new f("aborted","webUsdLoader: the load was aborted",{url:e});const x=new URL(e,"undefined"===typeof window?void 0:window.location.href).href,U=new AbortController,k=()=>U.abort(i.reason);null===i||void 0===i||i.addEventListener("abort",k,{once:!0});const R=ve({ktx2:s,fetchFn:w,headers:c,signal:U.signal,t0:b});for(const o of _(a,x).values())R.start(o,!0);a&&M("hintStarted");const B=L(n),E=Promise.all(B.map(e=>async function(e,t,o){let n,{signal:r,headers:s}=o;try{n=await e(t,{signal:r,headers:s,credentials:"same-origin"})}catch(a){throw new f(null!==r&&void 0!==r&&r.aborted?"aborted":"fetch","webUsdLoader: ".concat(t,": ").concat((null===a||void 0===a?void 0:a.message)||a),{cause:a,url:t})}if(!n.ok)throw new f("fetch","webUsdLoader: ".concat(t,": HTTP ").concat(n.status),{url:t,status:n.status});return n.blob()}(w,e===l?x:A(e,x),{signal:U.signal,headers:c})));E.catch(()=>{});const C=Promise.all([o.e(435),o.e(408)]).then(o.bind(o,408)),O=null===ne,P=async function(){const e=await ie(),t=re;return re=null,t&&(await t.ready,!t.dead)?{slot:t,module:e}:{slot:ce(),module:e}}();P.catch(()=>{});let T=null,I=!1;const W={posted:!1};let j=null;const z=()=>{if(U.signal.aborted)throw new f("aborted","webUsdLoader: the load was aborted",{url:e})};try{const[{slot:t,module:o},s,a]=await Promise.all([P,E,C]);T=t,I=!0,O&&null!==ne&&(y.wasmCompile=Math.round(10*ne)/10),M("ready"),z(),j=we(a,{maps:R,base:x,tier:n,compact:m,normals:g});const l=new Map([[u,new Blob([S(n)],{type:"text/plain"})]]);B.forEach((e,t)=>l.set(e,s[t]));const i={url:p+u,wasmModule:o,textures:h,files:l};if(me(T,await pe(T,i,j.receive,U.signal,W)),T=null,M("geometry"),z(),!j.bodies.size)throw new f("shape","webUsdLoader: no piece under /Asset/Bodies",{url:e});await R.settle(),z(),M("textures"),z(),j.attachMaps();for(const e of R.unused())e.dispose();M("total"),z();const c=j.stats()||{},d=R.all(),v=[...R.files.values()],w=()=>{j.geometries.forEach(e=>e.dispose());for(const e of j.materials.values())e.dispose();d.forEach(e=>e.dispose())};return{scene:j.root,bodies:j.bodies,materials:[...j.materials.values()],textures:d,info:{tier:n,meshes:j.counts.meshes,triangles:j.counts.triangles,loose:j.counts.loose,bodies:j.bodies.size,geometries:j.geometries.length,materials:j.materials.size,maps:v.filter(e=>e.used).length,hinted:v.filter(e=>e.hinted).length,hintMissed:v.filter(e=>e.used&&!e.hinted).length,hintUnused:v.filter(e=>!e.used).length,mapFiles:v.map(e=>({url:e.url,hinted:e.hinted,used:e.used,startMs:Math.round(e.startMs),readyMs:null===e.readyMs?null:Math.round(e.readyMs)})),reader:c,warnings:j.warnings,attributes:(0,r.A)((0,r.A)({},j.attrs),{},{ms:Math.round(10*j.attrs.ms)/10})},timings:y,dispose:w}}catch(D){if(U.abort(),T?W.posted?ue(T):me(T,0):I||P.then(e=>me(e.slot,0),()=>{}),j){j.geometries.forEach(e=>e.dispose());for(const e of j.materials.values())e.dispose()}const t=new Set(R.all());if(R.files.forEach(e=>{e.texture?t.add(e.texture):e.promise.then(e=>e.dispose(),()=>{})}),t.forEach(e=>e.dispose()),v(D))throw D;throw new f(null!==i&&void 0!==i&&i.aborted?"aborted":"compose","webUsdLoader: ".concat((null===D||void 0===D?void 0:D.message)||D),{cause:D,url:e})}finally{null===i||void 0===i||i.removeEventListener("abort",k)}}function ye(){ae(null),he=null,se=0,g=null}const Me=()=>({spawned:se,kept:!!re,compiled:!!oe})}}]);

services/explorer/dist/static/js/main.cf692f87.js.LICENSE.txt

@@ -0,0 +1,39 @@
+/**
+ * @license React
+ * react-dom.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * @license React
+ * react-jsx-runtime.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * @license React
+ * react.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * @license React
+ * scheduler.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */

services/explorer/dist/static/usd-reader/79236f8/esm/errors.js

@@ -0,0 +1,15 @@
+/** Why a load failed: `aborted`, `fetch` (root layer or a resource limit), `compose`, `worker` or `webgl`. */
+export class UsdLoadError extends Error {
+    name = "UsdLoadError";
+    code;
+    constructor(code, message, { url, status, cause } = {}) {
+        super(message, cause === undefined ? undefined : { cause });
+        this.code = code;
+        if (url !== undefined) {
+            this.url = url;
+        }
+        if (status !== undefined) {
+            this.status = status;
+        }
+    }
+}

services/explorer/dist/static/usd-reader/79236f8/esm/hub-prefetch.js

@@ -0,0 +1,94 @@
+// The layers of a Hub package, listed with one tree-API call, so a load can
+// request them all at once instead of discovering them a round trip at a time.
+const RESOLVE = /^(https:\/\/(?:huggingface\.co|hf\.co))\/((?:datasets\/|spaces\/)?)([^/?#]+\/[^/?#]+)\/resolve\/([^/?#]+)\/([^?#]+)$/;
+const LAYER = /\.(usd|usda|usdc)$/i;
+const SIMREADY_PACKAGE = "com.nvidia.simready.packaging.json";
+const MAX_FILES = 256;
+const MAX_BYTES = 64 * 2 ** 20;
+/**
+ * The USD layers of the package holding a Hub `resolve` URL, as `{ url, size }`:
+ * the directory with a SimReady packaging manifest among the root's parent
+ * and grandparent, else everything under the root's own directory. `eager`
+ * when a manifest declares the package, so its layers are worth requesting
+ * before the root is read. No layers, without a request, for a root at the
+ * top of its repo or any other URL, and none if the listing fails: the load then discovers layers as usual.
+ */
+export async function hubPackageLayers(rootUrl, request) {
+    const match = rootUrl.split(/[?#]/)[0].match(RESOLVE);
+    const none = { layers: [], eager: false };
+    if (!match) {
+        return none;
+    }
+    const [, origin, prefix, repo, revision, path] = match;
+    const parent = path.split("/").slice(0, -1);
+    // A root at the top of a repo would list, and preload, the whole repo.
+    if (!parent.length) {
+        return none;
+    }
+    const listed = parent.length > 1 ? parent.slice(0, -1) : parent;
+    try {
+        const response = await request(`${origin}/api/${prefix || "models/"}${repo}/tree/${revision}/${listed.join("/")}?recursive=true`);
+        if (!response.ok) {
+            return none;
+        }
+        const entries = await response.json();
+        const decoded = parent.map(decodeURIComponent);
+        const manifest = [decoded, decoded.slice(0, -1)].find((dir) => dir.length >= listed.length && entries.some((e) => e.path === [...dir, SIMREADY_PACKAGE].join("/")));
+        const depth = (manifest ?? decoded).length;
+        const packageDir = decoded
+            .slice(0, depth)
+            .map((name) => name + "/")
+            .join("");
+        // As the root spells it, so URLs match the ones composition resolves.
+        const base = `${origin}/${prefix}${repo}/resolve/${revision}/${parent
+            .slice(0, depth)
+            .map((name) => name + "/")
+            .join("")}`;
+        const layers = [];
+        let bytes = 0;
+        for (const { type, path: file, size } of entries) {
+            if (type !== "file" || !file.startsWith(packageDir) || !LAYER.test(file)) {
+                continue;
+            }
+            if (layers.length >= MAX_FILES || bytes + size > MAX_BYTES) {
+                continue;
+            }
+            bytes += size;
+            layers.push({
+                url: new URL(file.slice(packageDir.length).replace(/[%#?]/g, encodeURIComponent), base).href,
+                size,
+            });
+        }
+        return { layers, eager: !!manifest };
+    }
+    catch {
+        return none;
+    }
+}
+/**
+ * A Hub `resolve` URL pinned to the commit its branch or tag points at now,
+ * so every layer and texture of one load (all resolved against the root)
+ * comes from the same commit even if the repo is pushed to meanwhile. Unchanged,
+ * without a request, for a commit or any other URL, and if the lookup fails.
+ */
+export async function pinHubRevision(rootUrl, request) {
+    const match = rootUrl.split(/[?#]/)[0].match(RESOLVE);
+    if (!match) {
+        return rootUrl;
+    }
+    const [, origin, prefix, repo, revision] = match;
+    if (/^[0-9a-f]{40}$/.test(revision)) {
+        return rootUrl;
+    }
+    try {
+        const response = await request(`${origin}/api/${prefix || "models/"}${repo}/revision/${revision}?expand%5B%5D=sha`);
+        const { sha } = response.ok ? await response.json() : {};
+        if (!/^[0-9a-f]{40}$/.test(sha ?? "")) {
+            return rootUrl;
+        }
+        return rootUrl.replace(`/resolve/${revision}/`, `/resolve/${sha}/`);
+    }
+    catch {
+        return rootUrl;
+    }
+}

services/explorer/dist/static/usd-reader/79236f8/esm/load-core.js

@@ -0,0 +1,744 @@
+import { UsdLoadError } from "./errors.js";
+/** The load options' defaults, and the largest image side read at all. SECURITY.md documents the limits. */
+export const DEFAULTS = {
+    textures: "preview",
+    maxTextureSize: 1024,
+    maxConcurrentFetches: 16,
+    maxLayerBytes: 768 * 2 ** 20,
+    maxLayers: 1024,
+    maxInstances: 100000,
+    maxTriangles: 20e6,
+    maxTextureBytes: 512 * 2 ** 20,
+    maxImageSize: 16384,
+};
+/** Loads and composes the stage at `rootUrl`. */
+export async function composeStage({ UsdLoader, fetchBytes, rootUrl, maxConcurrentFetches = DEFAULTS.maxConcurrentFetches, maxLayerBytes = DEFAULTS.maxLayerBytes, maxLayers = DEFAULTS.maxLayers, maxInstances = DEFAULTS.maxInstances, allowedOrigins, preload, onProgress = () => { }, }) {
+    const root = rootUrl.split(/[?#]/)[0];
+    const urlOf = (path) => (path === root ? rootUrl : path);
+    const loader = new UsdLoader();
+    const stats = {
+        layers: 0,
+        layerBytes: 0,
+        missing: 0,
+        rounds: 0,
+        fetchMs: 0,
+        parseMs: 0,
+        composeMs: 0,
+        warnings: [],
+    };
+    const started = new Map();
+    const progress = () => onProgress({ stage: "layers", loaded: stats.layers + stats.missing, total: started.size, bytes: stats.layerBytes });
+    const throttle = limiter(maxConcurrentFetches);
+    // One budget for every layer body, charged as its bytes arrive, so fetches
+    // in parallel cannot each count on the whole remainder.
+    let heldBytes = 0;
+    const charge = (bytes, path) => {
+        heldBytes += bytes;
+        if (heldBytes > maxLayerBytes) {
+            throw resourceLimit(`layers exceed maxLayerBytes (${maxLayerBytes} bytes) at ${path}`);
+        }
+    };
+    // Re-fetched layers replace their earlier bytes, so count each path once.
+    const layerSizes = new Map();
+    // Speculative fetches by URL, dropped once composition is done. One that
+    // has not started when its layer is asked for, or that failed, gives way to
+    // the regular fetch, so the result is the same as without them. Their
+    // bytes are charged as they arrive, and stay charged once used.
+    const preloaded = new Map();
+    let composed = false;
+    // Every distinct layer URL requested, preloads included, for maxLayers.
+    const requested = new Set();
+    const startPreload = (layers) => {
+        let bytes = 0;
+        for (const { url, size } of layers) {
+            const key = urlKey(url);
+            bytes += size;
+            if (composed || bytes > maxLayerBytes) {
+                break;
+            }
+            if (requested.has(key)) {
+                continue;
+            }
+            if (requested.size >= maxLayers) {
+                break;
+            }
+            requested.add(key);
+            const entry = { started: false, charged: 0 };
+            preloaded.set(key, entry);
+            // Unused once composed: the next chunk cancels the body.
+            const budget = (bytes) => {
+                if (composed) {
+                    throw new Error("composed without it");
+                }
+                entry.charged += bytes;
+                charge(bytes, url);
+            };
+            entry.bytes = throttle(async () => {
+                if (composed || preloaded.get(key) !== entry) {
+                    return null;
+                }
+                entry.started = true;
+                const bytes = await fetchBytes(url, budget);
+                if (bytes) {
+                    budget(bytes.byteLength - entry.charged);
+                }
+                return bytes;
+            }, { later: true }).catch(() => {
+                heldBytes -= entry.charged;
+                entry.charged = 0;
+                return null;
+            });
+        }
+    };
+    const takePreloaded = (path) => {
+        const entry = preloaded.get(urlKey(path));
+        preloaded.delete(urlKey(path));
+        return entry?.started ? entry : null;
+    };
+    // Jobs in flight. A job queues its dependencies here rather than awaiting
+    // them, so layers that reference each other cannot wait on each other.
+    const pending = [];
+    const drain = async () => {
+        while (pending.length) {
+            await Promise.all(pending.splice(0));
+        }
+    };
+    const fetchLayer = (path) => {
+        if (loader.has(path) || started.has(path)) {
+            return;
+        }
+        requested.add(urlKey(path));
+        if (requested.size > maxLayers) {
+            throw resourceLimit(`more than maxLayers (${maxLayers}) layer files at ${path}`);
+        }
+        const { refused } = requestPolicy(urlOf(path), rootUrl, allowedOrigins);
+        if (refused) {
+            started.set(path, Promise.resolve());
+            stats.missing++;
+            stats.warnings.push({ code: "layer-missing", message: `layer not fetched: ${refused}`, path });
+            loader.markUnavailable(path);
+            progress();
+            return;
+        }
+        const job = (async () => {
+            const t0 = performance.now();
+            heldBytes -= layerSizes.get(path) ?? 0;
+            layerSizes.delete(path);
+            let charged = 0;
+            const budget = (bytes) => {
+                charged += bytes;
+                charge(bytes, path);
+            };
+            // Any fetch failure, HTTP or network: the root fails the load, any
+            // other layer is left out with a warning.
+            let bytes = null;
+            let failure = null;
+            try {
+                const entry = takePreloaded(path);
+                bytes = entry && (await entry.bytes);
+                if (entry && bytes) {
+                    charged = entry.charged;
+                }
+                bytes ??= await throttle(() => fetchBytes(urlOf(path), budget));
+            }
+            catch (error) {
+                heldBytes -= charged;
+                // HTTP errors carry a status; network errors are TypeErrors (as from fetch).
+                if (error?.status === undefined && !(error instanceof TypeError)) {
+                    throw error;
+                }
+                failure = error;
+            }
+            stats.fetchMs = Math.max(stats.fetchMs, performance.now() - t0);
+            if (!bytes) {
+                if (path === root) {
+                    const status = failure?.status ?? (failure ? undefined : 404);
+                    throw new UsdLoadError("fetch", `could not fetch ${rootUrl}${status ? ` (HTTP ${status})` : ""}`, {
+                        url: rootUrl,
+                        status,
+                        cause: failure ?? undefined,
+                    });
+                }
+                stats.missing++;
+                stats.warnings.push({
+                    code: "layer-missing",
+                    message: `layer not found: ${failure?.message ?? urlOf(path)}`,
+                    path: urlOf(path),
+                });
+                loader.markUnavailable(path);
+                progress();
+                return;
+            }
+            charge(bytes.byteLength - charged, path);
+            layerSizes.set(path, bytes.byteLength);
+            stats.layers++;
+            stats.layerBytes += bytes.byteLength;
+            const t1 = performance.now();
+            let deps;
+            try {
+                deps = loader.addLayer(path, bytes);
+            }
+            catch (error) {
+                // After a trap the module is unusable: the load fails.
+                if (isTrap(error)) {
+                    throw error;
+                }
+                // An unreadable layer is left out; composition carries on without it.
+                stats.warnings.push({
+                    code: "layer-unreadable",
+                    message: String(error.message || error),
+                    path: urlOf(path),
+                });
+                loader.markUnavailable(path);
+                progress();
+                return;
+            }
+            finally {
+                stats.parseMs += performance.now() - t1;
+            }
+            progress();
+            for (const dep of deps) {
+                fetchLayer(dep);
+            }
+        })();
+        started.set(path, job);
+        pending.push(job);
+    };
+    fetchLayer(root);
+    // A root without dependencies needs nothing else from its directory.
+    const rootHasDependencies = () => (started.get(root) ?? Promise.resolve()).then(() => started.size > 1, () => false);
+    preload?.then(async ({ layers, eager }) => (eager || (await rootHasDependencies())) && startPreload(layers));
+    await drain();
+    if (!loader.has(root)) {
+        const reason = stats.warnings.find((w) => w.path === rootUrl)?.message;
+        throw new UsdLoadError("compose", `could not read ${rootUrl}${reason ? `: ${reason}` : ""}`, { url: rootUrl });
+    }
+    for (;;) {
+        stats.rounds++;
+        onProgress({ stage: "compose", round: stats.rounds });
+        const t0 = performance.now();
+        const missing = loader.compose(root, maxInstances);
+        stats.composeMs += performance.now() - t0;
+        if (!missing.length) {
+            break;
+        }
+        if (stats.rounds > 16) {
+            throw new UsdLoadError("compose", `composition still missing layers: ${missing.join(", ")}`);
+        }
+        // The list also names layers the failed attempt consumed; fetch them again.
+        for (const path of missing) {
+            started.delete(path);
+        }
+        missing.forEach(fetchLayer);
+        await drain();
+    }
+    composed = true;
+    const scene = loader.takeScene();
+    loader.free();
+    const meta = JSON.parse(scene.meta());
+    return { scene, meta, stats };
+}
+/**
+ * What the page is told about a failed load. Fetch and resource-limit errors
+ * keep their code, url and status; anything the WASM side throws is a
+ * composition failure. Running out of WASM memory (4 GiB at most) reads as a
+ * scene too large to load: an allocation that fails while reading a layer
+ * reports "out of memory", one that aborts traps as a bare `unreachable`. A
+ * Rust panic, which also traps as `unreachable`, gives its message instead,
+ * read with `lastPanic` (the module's export). Overflowing the stack, the WASM one (an
+ * out-of-bounds access) or the engine's, means layers nested too deeply to read.
+ */
+export function loadFailure(error, wasmMemoryBytes, lastPanic) {
+    const { code = "compose", url, status } = (error ?? {});
+    const message = String(error?.message || error);
+    const failure = (detail) => ({ code, message: detail, url, status });
+    if (code !== "compose") {
+        return failure(message);
+    }
+    const tooLarge = () => failure(`scene too large to load: ran out of memory (${(wasmMemoryBytes / 2 ** 30).toFixed(1)} GiB of WebAssembly memory in use): ${message}`);
+    if (OUT_OF_MEMORY.test(message) || (error instanceof WebAssembly.RuntimeError && wasmMemoryBytes > 3 * 2 ** 30)) {
+        return tooLarge();
+    }
+    if (!isTrap(error)) {
+        return failure(message);
+    }
+    const panic = readPanic(lastPanic);
+    if (panic) {
+        return failure(`${message}: ${panic}`);
+    }
+    if (/out of bounds|call stack|recursion/i.test(message)) {
+        return failure(`stack overflow: the layers nest too deeply to read (${message})`);
+    }
+    // Rust aborts on a failed allocation without a panic: a bare `unreachable`.
+    if (/unreachable/i.test(message)) {
+        return tooLarge();
+    }
+    return failure(message);
+}
+/** Messages of allocations that failed, in Rust or in the engine. */
+export const OUT_OF_MEMORY = /out of memory|memory allocation|allocation failed|memory size exceeded|could not allocate/i;
+/** Reading the panic calls into the trapped module, which can trap again (an exhausted stack does). */
+function readPanic(lastPanic) {
+    try {
+        return lastPanic?.();
+    }
+    catch {
+        return undefined;
+    }
+}
+/** A WebAssembly trap or an exhausted engine call stack: the module is no longer usable. */
+function isTrap(error) {
+    return (error instanceof WebAssembly.RuntimeError ||
+        error instanceof RangeError ||
+        error?.name === "InternalError");
+}
+function resourceLimit(detail) {
+    return new UsdLoadError("fetch", `resource limit exceeded: ${detail}`);
+}
+/** Runs at most `max` of the given tasks at once; tasks marked `later` wait for the others. */
+export function limiter(max) {
+    let active = 0;
+    const queue = [];
+    const later = [];
+    const next = () => {
+        if (active >= max) {
+            return;
+        }
+        const job = queue.shift() ?? later.shift();
+        if (!job) {
+            return;
+        }
+        active++;
+        const { task, resolve, reject } = job;
+        task()
+            .then(resolve, reject)
+            .finally(() => {
+            active--;
+            next();
+        });
+    };
+    return (task, { later: low = false } = {}) => new Promise((resolve, reject) => {
+        (low ? later : queue).push({ task, resolve: resolve, reject });
+        next();
+    });
+}
+/** A layer URL as fetch would spell it, so an authored `a b.usd` matches a listed `a%20b.usd`. */
+function urlKey(url) {
+    try {
+        return new URL(url).href;
+    }
+    catch {
+        return url;
+    }
+}
+/**
+ * Fetches a body, passing each chunk's size to `budget` as it arrives and
+ * giving up (cancelling the body) when `budget` throws. An HTTP error throws a
+ * `fetch` UsdLoadError carrying the status. `fetchFn` is the global fetch or a
+ * stand-in with the same contract. Rate limiting (429) and server errors
+ * (5xx) are retried with backoff, as the Hub answers bursts with 429.
+ */
+export async function fetchLimited(url, budget, { fetchFn = fetch, retries = 3, retryDelayMs = 500, } = {}) {
+    let response = await fetchFn(url);
+    for (let attempt = 0; attempt < retries && (response.status === 429 || response.status >= 500); attempt++) {
+        response.body?.cancel().catch(() => { });
+        const retryAfterMs = Number(response.headers?.get("retry-after")) * 1000;
+        const delay = retryAfterMs > 0 ? Math.min(retryAfterMs, 10_000) : retryDelayMs * 2 ** attempt * (1 + Math.random());
+        await new Promise((resolve) => setTimeout(resolve, delay));
+        response = await fetchFn(url);
+    }
+    if (!response.ok) {
+        throw new UsdLoadError("fetch", `HTTP ${response.status} for ${url}`, { url, status: response.status });
+    }
+    if (!response.body) {
+        return new Uint8Array();
+    }
+    const reader = response.body.getReader();
+    const chunks = [];
+    let size = 0;
+    for (;;) {
+        const { done, value } = await reader.read();
+        if (done) {
+            break;
+        }
+        try {
+            budget(value.byteLength);
+        }
+        catch (error) {
+            await reader.cancel();
+            throw error;
+        }
+        size += value.byteLength;
+        chunks.push(value);
+    }
+    const out = new Uint8Array(size);
+    let offset = 0;
+    for (const chunk of chunks) {
+        out.set(chunk, offset);
+        offset += chunk.byteLength;
+    }
+    return out;
+}
+/**
+ * Size of a PNG, JPEG or WebP from its header, without decoding, and whether
+ * it is color: 8-bit RGB(A) or palette, rather than greyscale or 16-bit data
+ * (the images `sourceColorSpace = "auto"` decodes as sRGB; WebP is always
+ * color). Null for other formats, whose size cannot be checked before decoding.
+ */
+export function imageInfo(b) {
+    const v = new DataView(b.buffer, b.byteOffset, b.byteLength);
+    const ascii = (at, text) => [...text].every((c, i) => b[at + i] === c.charCodeAt(0));
+    if (b.length > 25 && b[0] === 0x89 && ascii(1, "PNG")) {
+        const [bitDepth, colorType] = [b[24], b[25]];
+        const color = colorType === 3 || (bitDepth === 8 && (colorType === 2 || colorType === 6));
+        return { width: v.getUint32(16), height: v.getUint32(20), color };
+    }
+    if (b[0] === 0xff && b[1] === 0xd8) {
+        let i = 2;
+        while (i + 9 < b.length) {
+            if (b[i] !== 0xff) {
+                return null;
+            }
+            const marker = b[i + 1];
+            const length = (b[i + 2] << 8) | b[i + 3];
+            const isFrame = marker >= 0xc0 && marker <= 0xcf && marker !== 0xc4 && marker !== 0xc8 && marker !== 0xcc;
+            if (isFrame) {
+                return {
+                    height: (b[i + 5] << 8) | b[i + 6],
+                    width: (b[i + 7] << 8) | b[i + 8],
+                    color: b[i + 4] === 8 && b[i + 9] >= 3,
+                };
+            }
+            i += 2 + length;
+        }
+        return null;
+    }
+    if (b.length >= 30 && ascii(0, "RIFF") && ascii(8, "WEBP")) {
+        // The first chunk: lossy (VP8), lossless (VP8L) or extended (VP8X).
+        if (ascii(12, "VP8 ")) {
+            return { width: v.getUint16(26, true) & 0x3fff, height: v.getUint16(28, true) & 0x3fff, color: true };
+        }
+        if (ascii(12, "VP8L")) {
+            const bits = v.getUint32(21, true);
+            return { width: (bits & 0x3fff) + 1, height: ((bits >>> 14) & 0x3fff) + 1, color: true };
+        }
+        if (ascii(12, "VP8X")) {
+            const u24 = (at) => b[at] | (b[at + 1] << 8) | (b[at + 2] << 16);
+            return { width: u24(24) + 1, height: u24(27) + 1, color: true };
+        }
+    }
+    return null;
+}
+// A trailing dot names the same host (`huggingface.co.`), so it matches too.
+const HUB_HOST = /^(huggingface\.co|hf\.co)\.?$/;
+const HUB_CDN = /\.hf\.co\.?$/;
+// Paths of Hub repo files, of the tree listing the prefetch reads and of the
+// revision lookup that pins a load to one commit: the only Hub URLs a load
+// requests, never other `/api/*` endpoints or account pages. The last group is
+// the revision.
+const HUB_FILE = /^\/(?:(datasets|spaces)\/)?([\w.-]+)\/([\w.-]+)\/resolve\/([^/]*)/;
+const HUB_TREE = /^\/api\/(datasets|models|spaces)\/([\w.-]+)\/([\w.-]+)\/(?:tree|revision)\/([^/]*)/;
+// First path segments of Hub pages and endpoints: never a model's owner.
+const HUB_RESERVED = new Set([
+    "api",
+    "oauth",
+    "settings",
+    "login",
+    "logout",
+    "join",
+    "docs",
+    "models",
+    "datasets",
+    "spaces",
+    "organizations",
+    "new",
+    "pricing",
+    "blog",
+    "papers",
+    "posts",
+    "collections",
+    "notifications",
+    "search",
+    "chat",
+    "learn",
+    "tasks",
+    "enterprise",
+    "billing",
+    "static-proxy",
+    "avatars",
+    "front",
+]);
+/** The path match of a Hub file or tree-listing URL (`[, type, owner, repo, revision]`), else null. */
+function hubMatch(url) {
+    if (!HUB_HOST.test(url.hostname) || url.protocol !== "https:") {
+        return null;
+    }
+    const file = url.pathname.match(HUB_FILE);
+    if (file && (file[1] || !HUB_RESERVED.has(file[2].toLowerCase()))) {
+        return file;
+    }
+    return url.pathname.match(HUB_TREE);
+}
+/** `type/owner/repo` of a Hub file or tree-listing URL, else null. */
+function hubRepo(url) {
+    const match = hubMatch(url);
+    return match && `${match[1] ?? "models"}/${match[2]}/${match[3]}`;
+}
+/**
+ * A URL on hf.co, the Hub's short domain, as the huggingface.co URL it
+ * redirects to: fetched directly, a request keeps its headers (a redirect
+ * to another origin drops them) and its credentials scope stays the same.
+ */
+export function canonicalUrl(url) {
+    try {
+        const parsed = new URL(url);
+        if (!/^hf\.co\.?$/.test(parsed.hostname)) {
+            return url;
+        }
+        parsed.hostname = "huggingface.co";
+        return parsed.href;
+    }
+    catch {
+        return url;
+    }
+}
+/** The scheme of files given with the `files` option: `local:///<key>`, the key percent-encoded. */
+export const LOCAL = "local:";
+/** A `files` key as the load spells it: `/` separators, no leading `./` or `/`. */
+export function localKey(key) {
+    return key.replace(/\\/g, "/").replace(/^(?:\.?\/)+/, "");
+}
+/** The URL a `files` key loads as; relative asset paths in the file resolve against it. */
+export function localUrl(key) {
+    return `${LOCAL}///${localKey(key).split("/").map(encodeURIComponent).join("/")}`;
+}
+/** The `files` key a `local:` URL names. */
+export function keyOfLocalUrl(url) {
+    return decodeURIComponent(new URL(url).pathname.slice(1));
+}
+/**
+ * How a load rooted at `rootUrl` may request `url`: `{ refused }` with the
+ * reason, or the fetch options to use. Every request a load makes goes
+ * through this first, then through {@link fetchWithPolicy}. Only the
+ * requested URL is checked: fetches follow redirects (a Hub `resolve` URL
+ * redirects to its CDN, which the Hub controls), but never with the caller's
+ * headers off the Hub.
+ *
+ * - hf.co URLs are checked as the huggingface.co URLs they redirect to.
+ * - The root URL itself, as the caller gave it, is always allowed.
+ * - A `local:` root (the `files` option) may read other `local:` URLs, which
+ *   are looked up in its files and never fetched; no other root may.
+ * - Only http(s), with no user name or password in the URL.
+ * - Origins: the root's, those in `allowedOrigins` (`'*'` for any) and, for a
+ *   root on the Hugging Face Hub, the Hub and its CDN hosts.
+ * - On huggingface.co and hf.co, only repo files (`…/resolve/…`) and tree
+ *   listings, under a user or organization name (not `/api/…`, `/oauth/…`
+ *   and other Hub pages), with no encoded slashes outside the revision (a
+ *   pull request's is `refs%2Fpr%2F1`).
+ * - Credentials (cookies and the caller's headers) go only to the root's own
+ *   origin or, for a Hub root, only to the root's own repo.
+ */
+export function requestPolicy(url, rootUrl, allowedOrigins = []) {
+    const refused = refusal(canonicalUrl(url), canonicalUrl(rootUrl), allowedOrigins);
+    if (refused) {
+        return { refused };
+    }
+    return {
+        credentials: credentialed(new URL(canonicalUrl(url)), new URL(canonicalUrl(rootUrl))) ? "same-origin" : "omit",
+        referrerPolicy: "no-referrer",
+    };
+}
+function refusal(url, rootUrl, allowedOrigins) {
+    if (url === rootUrl) {
+        return null;
+    }
+    let target;
+    try {
+        target = new URL(url);
+    }
+    catch {
+        return `not a URL: ${url}`;
+    }
+    const root = new URL(rootUrl);
+    if (root.protocol === LOCAL && target.protocol === LOCAL) {
+        return null;
+    }
+    if (target.protocol !== "http:" && target.protocol !== "https:") {
+        return `only http(s) URLs are fetched: ${url}`;
+    }
+    if (target.username || target.password) {
+        return `URLs with credentials are not fetched: ${url}`;
+    }
+    const hub = HUB_HOST.test(target.hostname);
+    if (hub && !hubFile(target)) {
+        return `only Hub repo files are fetched from ${target.host}: ${url}`;
+    }
+    const fromHub = HUB_HOST.test(root.hostname) && (hub || HUB_CDN.test(target.hostname)) && target.protocol === "https:";
+    if (target.origin === root.origin ||
+        fromHub ||
+        allowedOrigins.includes("*") ||
+        allowedOrigins.includes(target.origin)) {
+        return null;
+    }
+    return `its origin is not in allowedOrigins: ${url}`;
+}
+/** A Hub repo file or tree listing with no encoded slash or backslash, but for a `%2F` in its revision. */
+function hubFile(url) {
+    const match = hubMatch(url);
+    if (!match) {
+        return false;
+    }
+    const revisionStart = match[0].length - match[4].length;
+    const outside = url.pathname.slice(0, revisionStart) + url.pathname.slice(match[0].length);
+    return !/%2f|%5c/i.test(outside) && !/%5c/i.test(match[4]);
+}
+function credentialed(target, root) {
+    // Every `local:` URL's origin is the string "null", which would match any other's.
+    if (root.protocol === LOCAL) {
+        return false;
+    }
+    if (target.origin !== root.origin) {
+        return false;
+    }
+    const repo = hubRepo(root);
+    return HUB_HOST.test(root.hostname) ? !!repo && hubRepo(target) === repo : true;
+}
+/**
+ * Fetches `url` under `policy` (see {@link requestPolicy}), sending `headers`
+ * only where credentials may go. A request carrying them does not follow a
+ * redirect with them: unless it is on the Hub (whose redirects stay on its own
+ * hosts), it is not followed, and the URL is fetched again without headers or
+ * cookies, for the browser to follow.
+ */
+export async function fetchWithPolicy(url, policy, headers) {
+    const sendHeaders = policy.credentials === "same-origin" && !!headers && Object.keys(headers).length > 0;
+    if (!sendHeaders) {
+        return fetch(url, policy);
+    }
+    if (HUB_HOST.test(new URL(url).hostname)) {
+        return fetch(url, { ...policy, headers });
+    }
+    const response = await fetch(url, { ...policy, headers, redirect: "manual" });
+    if (response.type !== "opaqueredirect" && !(response.status >= 300 && response.status < 400)) {
+        return response;
+    }
+    response.body?.cancel().catch(() => { });
+    return fetch(url, { ...policy, credentials: "omit" });
+}
+/**
+ * Reads each geometry out of WASM in turn, so only one mesh's arrays are in
+ * WASM memory at a time, and calls `onGeometry(index, meta, arrays)` with
+ * JS-owned typed arrays (`meta` and `arrays` are null for a mesh with nothing
+ * drawable, or left out). Triangles count as drawn, once per instance:
+ * meshes that would take them past `maxTriangles` are left out unread.
+ * Releases the stage afterwards. Returns warnings: `triangle-limit` for
+ * meshes left out, `nothing-drawable` when no mesh had anything to draw.
+ */
+export function readGeometries(scene, meta, onGeometry, { maxTriangles = DEFAULTS.maxTriangles } = {}) {
+    const instances = Array.from({ length: meta.geometryCount }, () => 0);
+    for (const { geometry } of meta.instances) {
+        instances[geometry]++;
+    }
+    let drawn = 0;
+    let left = maxTriangles;
+    const skipped = [];
+    for (let i = 0; i < meta.geometryCount; i++) {
+        // Not drawn anywhere (e.g. all its instances past maxInstances).
+        if (!instances[i]) {
+            onGeometry(i, null, null);
+            continue;
+        }
+        const json = scene.read(i, Math.min(Math.floor(left / instances[i]), 2 ** 32 - 1));
+        const g = json && JSON.parse(json);
+        if (!g || "overBudget" in g) {
+            if (g) {
+                skipped.push(g.path);
+            }
+            onGeometry(i, null, null);
+            continue;
+        }
+        drawn++;
+        left = Math.max(0, left - instances[i] * g.groups.reduce((n, [, count]) => n + count / 3, 0));
+        onGeometry(i, g, {
+            positions: scene.positions(),
+            normals: scene.normals(),
+            uvs: g.uvSets.map((_, k) => scene.uvs(k)),
+            colors: g.hasColors ? scene.colors() : null,
+            indices: g.maxIndex < 65536 ? scene.indices16() : scene.indices(),
+        });
+    }
+    scene.finish();
+    const warnings = [];
+    if (skipped.length) {
+        warnings.push({
+            code: "triangle-limit",
+            message: `${skipped.length} meshes left out: past maxTriangles (${maxTriangles}) drawn`,
+            path: skipped[0],
+        });
+    }
+    if (!drawn) {
+        warnings.push({
+            code: "nothing-drawable",
+            message: "nothing to draw: the stage has no visible meshes with geometry",
+        });
+    }
+    return warnings;
+}
+/**
+ * Images stored inside a USDZ package (they cannot be fetched by URL) among
+ * the texture `jobs` (see {@link textureJobs}), each read once, by path, all
+ * together at most `maxBytes`. One that cannot be read maps to its error, so
+ * it fails as that texture rather than the whole load.
+ */
+export function takePackagedTextures(scene, jobs, { maxBytes = Infinity } = {}) {
+    const out = new Map();
+    let left = maxBytes;
+    for (const { path } of jobs) {
+        if (!path.includes("[")) {
+            continue;
+        }
+        try {
+            const bytes = scene.packagedFile(path, left);
+            if (bytes) {
+                out.set(path, bytes);
+            }
+            left -= bytes?.byteLength ?? 0;
+        }
+        catch (error) {
+            out.set(path, error);
+        }
+    }
+    return out;
+}
+/** Long-side cap for data maps (roughness, metallic, occlusion, ...) in `preview` mode. */
+const PREVIEW_DATA_SIZE = 512;
+/**
+ * The texture files to load and the size to decode each to, base colors first.
+ * `preview`: base color up to `maxSize`, other maps up to 512 px, no normal
+ * maps. `full`: every map, including normals, up to `maxSize`. `none`: nothing.
+ */
+export function textureJobs(meta, { textures, maxSize }) {
+    if (textures === "none") {
+        return [];
+    }
+    const full = textures === "full";
+    const dataSize = full ? maxSize : Math.min(maxSize, PREVIEW_DATA_SIZE);
+    const tiers = [
+        [["diffuseColor"], maxSize],
+        [["opacity", "emissiveColor", "roughness", "metallic", "occlusion"], dataSize],
+        [full ? ["normal"] : [], maxSize],
+    ];
+    const jobs = new Map();
+    for (const [inputs, size] of tiers) {
+        for (const m of meta.materials) {
+            for (const input of inputs) {
+                const path = m.maps[input]?.path;
+                // A file shared by several inputs is decoded once, at the largest size asked.
+                if (path) {
+                    jobs.set(path, Math.max(jobs.get(path) ?? 0, size));
+                }
+            }
+        }
+    }
+    return [...jobs].map(([path, size]) => ({ path, size }));
+}

services/explorer/dist/static/usd-reader/79236f8/esm/worker.js

@@ -0,0 +1,147 @@
+// Loads, composes and extracts a USD stage off the main thread, then streams
+// textures as downscaled ImageBitmaps. One worker per load: the page
+// terminates it when done, disposed or aborted, which releases all WASM memory.
+import init, { lastPanic, UsdLoader } from "../wasm/usd_wasm.js";
+import { hubPackageLayers, pinHubRevision } from "./hub-prefetch.js";
+import { DEFAULTS, LOCAL, canonicalUrl, composeStage, fetchLimited, fetchWithPolicy, imageInfo, keyOfLocalUrl, limiter, loadFailure, readGeometries, requestPolicy, takePackagedTextures, textureJobs, } from "./load-core.js";
+// Textures in flight at once (fetch and decode): decoding a large image
+// briefly holds it at full size, so wide parallelism spikes memory.
+const TEXTURE_CONCURRENCY = 4;
+// Longest side of an image read at all: larger ones are refused from their
+// header, before decoding (WebGL's own limit is commonly 16384 too).
+const MAX_IMAGE_SIZE = DEFAULTS.maxImageSize;
+self.onmessage = async ({ data }) => {
+    const { url, wasmModule, maxTextureSize = DEFAULTS.maxTextureSize, textures = DEFAULTS.textures, maxConcurrentFetches = DEFAULTS.maxConcurrentFetches, maxLayerBytes, maxTextureBytes = DEFAULTS.maxTextureBytes, maxLayers, maxInstances, maxTriangles, allowedOrigins, headers, files, } = data;
+    // Every request (layer, texture, Hub listing) goes through here, and
+    // through the request policy first. The caller's headers go only where
+    // cookies may, and never through a redirect off the Hub.
+    const request = async (target) => {
+        target = canonicalUrl(target);
+        const policy = requestPolicy(target, url, allowedOrigins);
+        // Reads like a network failure: a missing layer or a failed texture.
+        if (policy.refused !== undefined) {
+            throw new TypeError(`request refused: ${policy.refused}`);
+        }
+        if (target.startsWith(LOCAL)) {
+            const file = files?.get(keyOfLocalUrl(target));
+            return file ? new Response(file) : new Response(null, { status: 404 });
+        }
+        return fetchWithPolicy(target, policy, headers);
+    };
+    const fetchBytes = (target, budget) => fetchLimited(target, budget, { fetchFn: request });
+    // One budget for every texture, packaged ones first, then each fetched
+    // body as its bytes arrive. Bytes of a body cut short stay charged: they
+    // were downloaded.
+    let textureBytes = 0;
+    const chargeTexture = (bytes) => {
+        textureBytes += bytes;
+        if (textureBytes > maxTextureBytes) {
+            throw new Error(`textures exceed maxTextureBytes (${maxTextureBytes} bytes)`);
+        }
+    };
+    const progress = (p) => self.postMessage({ type: "progress", progress: p });
+    let wasmMemory;
+    try {
+        const t0 = performance.now();
+        // Looked up while the WASM module initializes.
+        const rootUrl = pinHubRevision(url, request);
+        const preload = rootUrl.then((root) => hubPackageLayers(root, request));
+        const wasm = await init({ module_or_path: wasmModule });
+        wasmMemory = wasm.memory;
+        const tInit = performance.now();
+        const { scene, meta, stats } = await composeStage({
+            UsdLoader,
+            fetchBytes,
+            rootUrl: await rootUrl,
+            maxConcurrentFetches,
+            maxLayerBytes,
+            maxLayers,
+            maxInstances,
+            allowedOrigins,
+            preload,
+            onProgress: progress,
+        });
+        stats.initMs = tInit - t0;
+        self.postMessage({ type: "meta", meta });
+        // One mesh at a time: each is transferred (not copied) as soon as it is read.
+        const onGeometry = (index, g, arrays) => {
+            const transfer = arrays
+                ? [arrays.positions, arrays.normals, arrays.colors, arrays.indices, ...arrays.uvs]
+                    .filter((a) => !!a)
+                    .map((a) => a.buffer)
+                : [];
+            self.postMessage({ type: "geometry", index, meta: g, arrays }, transfer);
+            progress({ stage: "geometry", loaded: index + 1, total: meta.geometryCount });
+        };
+        const warnings = readGeometries(scene, meta, onGeometry, { maxTriangles });
+        const jobs = textureJobs(meta, { textures, maxSize: maxTextureSize });
+        const packaged = takePackagedTextures(scene, jobs, { maxBytes: maxTextureBytes });
+        for (const entry of packaged.values()) {
+            if (!(entry instanceof Error)) {
+                textureBytes += entry.byteLength;
+            }
+        }
+        scene.free();
+        stats.warnings.push(...warnings);
+        stats.totalMs = performance.now() - t0;
+        stats.wasmMemoryBytes = wasm.memory.buffer.byteLength;
+        self.postMessage({ type: "scene", stats: stats });
+        let loaded = 0;
+        let bytes = 0;
+        progress({ stage: "textures", loaded, total: jobs.length, bytes });
+        // The limiter runs jobs in order, so base colors come first.
+        const throttle = limiter(Math.min(maxConcurrentFetches, TEXTURE_CONCURRENCY));
+        await Promise.all(jobs.map(({ path, size }) => throttle(async () => {
+            try {
+                const entry = packaged.get(path);
+                if (entry instanceof Error) {
+                    throw entry;
+                }
+                // A packaged path is never a URL to fetch.
+                if (!entry && path.includes("[")) {
+                    throw new Error(`not found in its package: ${path}`);
+                }
+                const image = entry ?? (await fetchBytes(path, chargeTexture));
+                bytes += image.byteLength;
+                const { bitmap, color } = await decodeTexture(image, size);
+                self.postMessage({ type: "texture", path, bitmap, color }, [bitmap]);
+            }
+            catch (error) {
+                self.postMessage({ type: "texture", path, error: String(error?.message || error) });
+            }
+            progress({ stage: "textures", loaded: ++loaded, total: jobs.length, bytes });
+        })));
+        self.postMessage({ type: "done" });
+    }
+    catch (error) {
+        self.postMessage({ type: "error", ...loadFailure(error, wasmMemory?.buffer.byteLength ?? 0, lastPanic) });
+    }
+};
+/**
+ * Decodes a PNG, JPEG or WebP straight to at most `maxSize` px on its long
+ * side, and tells whether it holds color (what `sourceColorSpace = "auto"`
+ * decodes as sRGB). Images whose size the header does not give, or that are
+ * too large, are refused before decoding.
+ */
+async function decodeTexture(bytes, maxSize) {
+    const info = imageInfo(bytes);
+    if (!info) {
+        throw new Error("unsupported image format: only PNG, JPEG and WebP are read");
+    }
+    if (Math.max(info.width, info.height) > MAX_IMAGE_SIZE) {
+        throw new Error(`image too large: ${info.width}x${info.height} (at most ${MAX_IMAGE_SIZE} px a side)`);
+    }
+    // USD texture coordinates put (0,0) at the bottom-left, three.js's default.
+    const options = {
+        imageOrientation: "flipY",
+        premultiplyAlpha: "none",
+        colorSpaceConversion: "none",
+    };
+    const scale = Math.min(1, maxSize / Math.max(info.width, info.height));
+    if (scale < 1) {
+        options.resizeWidth = Math.max(1, Math.round(info.width * scale));
+        options.resizeHeight = Math.max(1, Math.round(info.height * scale));
+        options.resizeQuality = "high";
+    }
+    return { bitmap: await createImageBitmap(new Blob([bytes]), options), color: info.color };
+}

services/explorer/dist/static/usd-reader/79236f8/wasm/usd_wasm.js

@@ -0,0 +1,683 @@
+/* @ts-self-types="./usd_wasm.d.ts" */
+
+export class UsdLoader {
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+        UsdLoaderFinalization.unregister(this);
+        return ptr;
+    }
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_usdloader_free(ptr, 0);
+    }
+    /**
+     * Stores a layer and returns the layers it names outside unselected
+     * variants (see [`Loader::add_layer`]).
+     * @param {string} path
+     * @param {Uint8Array} bytes
+     * @returns {string[]}
+     */
+    addLayer(path, bytes) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(path, wasm.__wbindgen_export2, wasm.__wbindgen_export3);
+            const len0 = WASM_VECTOR_LEN;
+            const ptr1 = passArray8ToWasm0(bytes, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            wasm.usdloader_addLayer(retptr, this.__wbg_ptr, ptr0, len0, ptr1, len1);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v3 = getArrayJsValueFromWasm0(r0, r1);
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v3;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Composes the stage at `root`. Returns the layers still missing; when
+     * that is empty the scene is ready for [`take_scene`](Self::take_scene).
+     * The scene draws at most `max_instances` mesh instances.
+     * @param {string} root
+     * @param {number} max_instances
+     * @returns {string[]}
+     */
+    compose(root, max_instances) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(root, wasm.__wbindgen_export2, wasm.__wbindgen_export3);
+            const len0 = WASM_VECTOR_LEN;
+            wasm.usdloader_compose(retptr, this.__wbg_ptr, ptr0, len0, max_instances);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v2 = getArrayJsValueFromWasm0(r0, r1);
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v2;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * @param {string} path
+     * @returns {boolean}
+     */
+    has(path) {
+        const ptr0 = passStringToWasm0(path, wasm.__wbindgen_export2, wasm.__wbindgen_export3);
+        const len0 = WASM_VECTOR_LEN;
+        const ret = wasm.usdloader_has(this.__wbg_ptr, ptr0, len0);
+        return ret !== 0;
+    }
+    /**
+     * @param {string} path
+     */
+    markUnavailable(path) {
+        const ptr0 = passStringToWasm0(path, wasm.__wbindgen_export2, wasm.__wbindgen_export3);
+        const len0 = WASM_VECTOR_LEN;
+        wasm.usdloader_markUnavailable(this.__wbg_ptr, ptr0, len0);
+    }
+    constructor() {
+        const ret = wasm.usdloader_new();
+        this.__wbg_ptr = ret;
+        UsdLoaderFinalization.register(this, this.__wbg_ptr, this);
+        return this;
+    }
+    /**
+     * Hands over the extracted scene and drops every stored layer.
+     * @returns {UsdScene}
+     */
+    takeScene() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdloader_takeScene(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return UsdScene.__wrap(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+}
+if (Symbol.dispose) UsdLoader.prototype[Symbol.dispose] = UsdLoader.prototype.free;
+
+/**
+ * A composed scene whose meshes are read one at a time: `read(i)` makes
+ * geometry `i` current, and the array getters move its data out (each once).
+ * Only the current mesh's arrays live in WASM memory at any time.
+ */
+export class UsdScene {
+    static __wrap(ptr) {
+        const obj = Object.create(UsdScene.prototype);
+        obj.__wbg_ptr = ptr;
+        UsdSceneFinalization.register(obj, obj.__wbg_ptr, obj);
+        return obj;
+    }
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+        UsdSceneFinalization.unregister(this);
+        return ptr;
+    }
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_usdscene_free(ptr, 0);
+    }
+    /**
+     * @returns {Float32Array}
+     */
+    colors() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_colors(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayF32FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Releases the stage once every geometry has been read.
+     */
+    finish() {
+        wasm.usdscene_finish(this.__wbg_ptr);
+    }
+    /**
+     * Indices as 16-bit, for geometries with fewer than 65536 vertices.
+     * @returns {Uint16Array}
+     */
+    indices16() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_indices16(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayU16FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 2, 2);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * @returns {Uint32Array}
+     */
+    indices() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_indices(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayU32FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Everything but the triangle data, as JSON.
+     * @returns {string}
+     */
+    meta() {
+        let deferred1_0;
+        let deferred1_1;
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_meta(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            deferred1_0 = r0;
+            deferred1_1 = r1;
+            return getStringFromWasm0(r0, r1);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+            wasm.__wbindgen_export(deferred1_0, deferred1_1, 1);
+        }
+    }
+    /**
+     * @returns {Float32Array}
+     */
+    normals() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_normals(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayF32FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * A texture that lives inside a USDZ package, if `path` names one there.
+     * Fails rather than expand it past `limit` bytes.
+     * @param {string} path
+     * @param {number} limit
+     * @returns {Uint8Array | undefined}
+     */
+    packagedFile(path, limit) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(path, wasm.__wbindgen_export2, wasm.__wbindgen_export3);
+            const len0 = WASM_VECTOR_LEN;
+            wasm.usdscene_packagedFile(retptr, this.__wbg_ptr, ptr0, len0, limit);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            let v2;
+            if (r0 !== 0) {
+                v2 = getArrayU8FromWasm0(r0, r1).slice();
+                wasm.__wbindgen_export(r0, r1 * 1, 1);
+            }
+            return v2;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * @returns {Float32Array}
+     */
+    positions() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_positions(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayF32FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Reads geometry `index` and returns its metadata as JSON, or `None` when
+     * the mesh has nothing drawable. A mesh with more than `max_triangles` is
+     * left unread: `{"overBudget": triangles, "path": prim path}`.
+     * @param {number} index
+     * @param {number} max_triangles
+     * @returns {string | undefined}
+     */
+    read(index, max_triangles) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_read(retptr, this.__wbg_ptr, index, max_triangles);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            let v1;
+            if (r0 !== 0) {
+                v1 = getStringFromWasm0(r0, r1);
+                wasm.__wbindgen_export(r0, r1 * 1, 1);
+            }
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * UV set `set` (in the order of the geometry's `uvSets`).
+     * @param {number} set
+     * @returns {Float32Array}
+     */
+    uvs(set) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.usdscene_uvs(retptr, this.__wbg_ptr, set);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            var r3 = getDataViewMemory0().getInt32(retptr + 4 * 3, true);
+            if (r3) {
+                throw takeObject(r2);
+            }
+            var v1 = getArrayF32FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export(r0, r1 * 4, 4);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+}
+if (Symbol.dispose) UsdScene.prototype[Symbol.dispose] = UsdScene.prototype.free;
+
+/**
+ * Takes the message of the last panic, if any.
+ * @returns {string | undefined}
+ */
+export function lastPanic() {
+    try {
+        const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+        wasm.lastPanic(retptr);
+        var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+        var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+        let v1;
+        if (r0 !== 0) {
+            v1 = getStringFromWasm0(r0, r1);
+            wasm.__wbindgen_export(r0, r1 * 1, 1);
+        }
+        return v1;
+    } finally {
+        wasm.__wbindgen_add_to_stack_pointer(16);
+    }
+}
+
+export function start() {
+    wasm.start();
+}
+function __wbg_get_imports() {
+    const import0 = {
+        __proto__: null,
+        __wbg_Error_30c8987f7c2ed4e2: function(arg0, arg1) {
+            const ret = Error(getStringFromWasm0(arg0, arg1));
+            return addHeapObject(ret);
+        },
+        __wbg___wbindgen_throw_41e9ee4f547fc59a: function(arg0, arg1) {
+            throw new Error(getStringFromWasm0(arg0, arg1));
+        },
+        __wbindgen_generic_0000000000000001: function(arg0, arg1) {
+            // Cast intrinsic for `Ref(String) -> Externref`.
+            const ret = getStringFromWasm0(arg0, arg1);
+            return addHeapObject(ret);
+        },
+    };
+    return {
+        __proto__: null,
+        "./usd_wasm_bg.js": import0,
+    };
+}
+
+const UsdLoaderFinalization = (typeof FinalizationRegistry === 'undefined')
+    ? { register: () => {}, unregister: () => {} }
+    : new FinalizationRegistry(ptr => wasm.__wbg_usdloader_free(ptr, 1));
+const UsdSceneFinalization = (typeof FinalizationRegistry === 'undefined')
+    ? { register: () => {}, unregister: () => {} }
+    : new FinalizationRegistry(ptr => wasm.__wbg_usdscene_free(ptr, 1));
+
+function addHeapObject(obj) {
+    if (heap_next === heap.length) heap.push(heap.length + 1);
+    const idx = heap_next;
+    heap_next = heap[idx];
+
+    heap[idx] = obj;
+    return idx;
+}
+
+function dropObject(idx) {
+    if (idx < 1028) return;
+    heap[idx] = heap_next;
+    heap_next = idx;
+}
+
+function getArrayF32FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getFloat32ArrayMemory0().subarray(ptr / 4, ptr / 4 + len);
+}
+
+function getArrayJsValueFromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    const mem = getDataViewMemory0();
+    const result = [];
+    for (let i = ptr; i < ptr + 4 * len; i += 4) {
+        result.push(takeObject(mem.getUint32(i, true)));
+    }
+    return result;
+}
+
+function getArrayU16FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint16ArrayMemory0().subarray(ptr / 2, ptr / 2 + len);
+}
+
+function getArrayU32FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint32ArrayMemory0().subarray(ptr / 4, ptr / 4 + len);
+}
+
+function getArrayU8FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint8ArrayMemory0().subarray(ptr / 1, ptr / 1 + len);
+}
+
+let cachedDataViewMemory0 = null;
+function getDataViewMemory0() {
+    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
+        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
+    }
+    return cachedDataViewMemory0;
+}
+
+let cachedFloat32ArrayMemory0 = null;
+function getFloat32ArrayMemory0() {
+    if (cachedFloat32ArrayMemory0 === null || cachedFloat32ArrayMemory0.byteLength === 0) {
+        cachedFloat32ArrayMemory0 = new Float32Array(wasm.memory.buffer);
+    }
+    return cachedFloat32ArrayMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    return decodeText(ptr >>> 0, len);
+}
+
+let cachedUint16ArrayMemory0 = null;
+function getUint16ArrayMemory0() {
+    if (cachedUint16ArrayMemory0 === null || cachedUint16ArrayMemory0.byteLength === 0) {
+        cachedUint16ArrayMemory0 = new Uint16Array(wasm.memory.buffer);
+    }
+    return cachedUint16ArrayMemory0;
+}
+
+let cachedUint32ArrayMemory0 = null;
+function getUint32ArrayMemory0() {
+    if (cachedUint32ArrayMemory0 === null || cachedUint32ArrayMemory0.byteLength === 0) {
+        cachedUint32ArrayMemory0 = new Uint32Array(wasm.memory.buffer);
+    }
+    return cachedUint32ArrayMemory0;
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function getObject(idx) { return heap[idx]; }
+
+let heap = new Array(1024).fill(undefined);
+heap.push(undefined, null, true, false);
+
+let heap_next = heap.length;
+
+function passArray8ToWasm0(arg, malloc) {
+    const ptr = malloc(arg.length * 1, 1) >>> 0;
+    getUint8ArrayMemory0().set(arg, ptr / 1);
+    WASM_VECTOR_LEN = arg.length;
+    return ptr;
+}
+
+function passStringToWasm0(arg, malloc, realloc) {
+    if (realloc === undefined) {
+        const buf = cachedTextEncoder.encode(arg);
+        const ptr = malloc(buf.length, 1) >>> 0;
+        getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf);
+        WASM_VECTOR_LEN = buf.length;
+        return ptr;
+    }
+
+    let len = arg.length;
+    let ptr = malloc(len, 1) >>> 0;
+
+    const mem = getUint8ArrayMemory0();
+
+    let offset = 0;
+
+    for (; offset < len; offset++) {
+        const code = arg.charCodeAt(offset);
+        if (code > 0x7F) break;
+        mem[ptr + offset] = code;
+    }
+    if (offset !== len) {
+        if (offset !== 0) {
+            arg = arg.slice(offset);
+        }
+        ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0;
+        const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len);
+        const ret = cachedTextEncoder.encodeInto(arg, view);
+
+        offset += ret.written;
+        ptr = realloc(ptr, len, offset, 1) >>> 0;
+    }
+
+    WASM_VECTOR_LEN = offset;
+    return ptr;
+}
+
+function takeObject(idx) {
+    const ret = getObject(idx);
+    dropObject(idx);
+    return ret;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+const MAX_SAFARI_DECODE_BYTES = 2146435072;
+let numBytesDecoded = 0;
+function decodeText(ptr, len) {
+    numBytesDecoded += len;
+    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
+        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+        cachedTextDecoder.decode();
+        numBytesDecoded = len;
+    }
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+const cachedTextEncoder = new TextEncoder();
+
+if (!('encodeInto' in cachedTextEncoder)) {
+    cachedTextEncoder.encodeInto = function (arg, view) {
+        const buf = cachedTextEncoder.encode(arg);
+        view.set(buf);
+        return {
+            read: arg.length,
+            written: buf.length
+        };
+    };
+}
+
+let WASM_VECTOR_LEN = 0;
+
+let wasmModule, wasmInstance, wasm;
+function __wbg_finalize_init(instance, module) {
+    wasmInstance = instance;
+    wasm = instance.exports;
+    wasmModule = module;
+    cachedDataViewMemory0 = null;
+    cachedFloat32ArrayMemory0 = null;
+    cachedUint16ArrayMemory0 = null;
+    cachedUint32ArrayMemory0 = null;
+    cachedUint8ArrayMemory0 = null;
+    wasm.__wbindgen_start();
+    return wasm;
+}
+
+async function __wbg_load(module, imports) {
+    if (typeof Response === 'function' && module instanceof Response) {
+        if (!module.ok) {
+            throw new Error(`failed to fetch Wasm: ${module.status} ${module.statusText} fetching '${module.url}'`);
+        }
+
+        if (typeof WebAssembly.instantiateStreaming === 'function') {
+            try {
+                return await WebAssembly.instantiateStreaming(module, imports);
+            } catch (e) {
+                const validResponse = expectedResponseType(module.type);
+
+                if (validResponse && module.headers.get('Content-Type') !== 'application/wasm') {
+                    console.warn("`WebAssembly.instantiateStreaming` failed because your server does not serve Wasm with `application/wasm` MIME type. Falling back to `WebAssembly.instantiate` which is slower. Original error:\n", e);
+
+                } else { throw e; }
+            }
+        }
+
+        const bytes = await module.arrayBuffer();
+        return await WebAssembly.instantiate(bytes, imports);
+    } else {
+        const instance = await WebAssembly.instantiate(module, imports);
+
+        if (instance instanceof WebAssembly.Instance) {
+            return { instance, module };
+        } else {
+            return instance;
+        }
+    }
+
+    function expectedResponseType(type) {
+        switch (type) {
+            case 'basic': case 'cors': case 'default': return true;
+        }
+        return false;
+    }
+}
+
+function initSync(module) {
+    if (wasm !== undefined) return wasm;
+
+
+    if (module !== undefined) {
+        if (Object.getPrototypeOf(module) === Object.prototype) {
+            ({module} = module)
+        } else {
+            console.warn('using deprecated parameters for `initSync()`; pass a single object instead')
+        }
+    }
+
+    const imports = __wbg_get_imports();
+    if (!(module instanceof WebAssembly.Module)) {
+        module = new WebAssembly.Module(module);
+    }
+    const instance = new WebAssembly.Instance(module, imports);
+    return __wbg_finalize_init(instance, module);
+}
+
+async function __wbg_init(module_or_path) {
+    if (wasm !== undefined) return wasm;
+
+
+    if (module_or_path !== undefined) {
+        if (Object.getPrototypeOf(module_or_path) === Object.prototype) {
+            ({module_or_path} = module_or_path)
+        } else {
+            console.warn('using deprecated parameters for the initialization function; pass a single object instead')
+        }
+    }
+
+    if (module_or_path === undefined) {
+        module_or_path = new URL('usd_wasm_bg.wasm', import.meta.url);
+    }
+    const imports = __wbg_get_imports();
+
+    if (typeof module_or_path === 'string' || (typeof Request === 'function' && module_or_path instanceof Request) || (typeof URL === 'function' && module_or_path instanceof URL)) {
+        module_or_path = fetch(module_or_path);
+    }
+
+    const { instance, module } = await __wbg_load(await module_or_path, imports);
+
+    return __wbg_finalize_init(instance, module);
+}
+
+export { initSync, __wbg_init as default };

services/explorer/dist/static/usd-reader/79236f8/wasm/usd_wasm_bg.wasm

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:af8aa7e87080ade38ae5c9912a16f046dedaaa0f3c21a00ed3aef25a75e47811
+size 2320130

services/explorer/dist/third-party-notices.txt

@@ -1,9 +1,9 @@
-Third-party notices — SimReady Central Explorer slim-ui-b62bb449
+Third-party notices — SimReady Central Explorer slim-ui-6262a66a
 
 The software in this web application's browser bundle includes the packages below, each under its own
 license. Each entry gives the package, its version, its license and the license / notice text it ships.
 
-31 third-party packages: Apache-2.0 2, MIT 29
+32 third-party packages: Apache-2.0 2, MIT 29, MIT AND Unicode-3.0 AND Zlib AND Apache-2.0 1
 7 NVIDIA packages: @kui-contrib/brand-logo, @kui/foundations-css, @kui/foundations-react, @kui/foundations-react-core, @omniverse/auth, @omniverse/discovery, @omniverse/idl
 
 ====================================================================================================
@@ -1310,6 +1310,1463 @@ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 
+====================================================================================================
+usd-web-viewer (Web USD reader) (copied out of usd-web-viewer 0.1.0)
+License: MIT AND Unicode-3.0 AND Zlib AND Apache-2.0
+Homepage: https://github.com/cfahlgren1/usd-web-viewer
+----------------------------------------------------------------------------------------------------
+[usd-web-viewer/LICENSE]
+
+MIT License
+
+Copyright (c) 2026 Caleb Fahlgren
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+----------------------------------------------------------------------------------------------------
+[usd-web-viewer/THIRD_PARTY_LICENSES]
+
+Third-party software linked into the WebAssembly module (wasm/usd_wasm_bg.wasm).
+Generated by scripts/third-party-licenses.mjs from Cargo.lock.
+
+bitflags 2.13.2: MIT OR Apache-2.0, used under MIT (https://github.com/bitflags/bitflags)
+bumpalo 3.20.3: MIT OR Apache-2.0, used under MIT (https://github.com/fitzgen/bumpalo)
+bytemuck 1.25.2: Zlib OR Apache-2.0 OR MIT, used under MIT (https://github.com/Lokathor/bytemuck)
+cfg-if 1.0.5: MIT OR Apache-2.0, used under MIT (https://github.com/rust-lang/cfg-if)
+crc32fast 1.5.2: MIT OR Apache-2.0, used under MIT (https://github.com/srijs/rust-crc32fast)
+derive_more 2.1.1: MIT (https://github.com/JelteF/derive_more)
+equivalent 1.0.2: Apache-2.0 OR MIT, used under MIT (https://github.com/indexmap-rs/equivalent)
+flate2 1.1.10: MIT OR Apache-2.0, used under MIT (https://github.com/rust-lang/flate2-rs)
+half 2.7.1: MIT OR Apache-2.0, used under MIT (https://github.com/VoidStarKat/half-rs)
+hashbrown 0.17.1: MIT OR Apache-2.0, used under MIT (https://github.com/rust-lang/hashbrown)
+indexmap 2.14.2: Apache-2.0 OR MIT, used under MIT (https://github.com/indexmap-rs/indexmap)
+libm 0.2.16: MIT (https://github.com/rust-lang/compiler-builtins)
+log 0.4.34: MIT OR Apache-2.0, used under MIT (https://github.com/rust-lang/log)
+logos 0.16.1: MIT OR Apache-2.0, used under MIT (https://github.com/maciejhirsz/logos)
+lz4_flex 0.14.0: MIT (https://github.com/pseitz/lz4_flex)
+memchr 2.8.3: Unlicense OR MIT, used under MIT (https://github.com/BurntSushi/memchr)
+num-traits 0.2.19: MIT OR Apache-2.0, used under MIT (https://github.com/rust-num/num-traits)
+once_cell 1.21.4: MIT OR Apache-2.0, used under MIT (https://github.com/matklad/once_cell)
+openusd 0.8.0: MIT (https://github.com/mxpv/openusd)
+openusd-schemas 0.8.0: MIT (https://github.com/mxpv/openusd)
+regex-lite 0.1.9: MIT OR Apache-2.0, used under MIT (https://github.com/rust-lang/regex)
+simd-adler32 0.3.10: MIT (https://github.com/mcountryman/simd-adler32)
+strum 0.28.0: MIT (https://github.com/Peternator7/strum)
+thiserror 2.0.21: MIT OR Apache-2.0, used under MIT (https://github.com/dtolnay/thiserror)
+twox-hash 2.1.5: MIT (https://github.com/shepmaster/twox-hash)
+typed-path 0.12.3: MIT OR Apache-2.0, used under MIT (https://github.com/chipsenkbeil/typed-path)
+unicode-ident 1.0.26: (MIT OR Apache-2.0) AND Unicode-3.0, used under MIT AND Unicode-3.0 (https://github.com/dtolnay/unicode-ident)
+wasm-bindgen 0.2.129: MIT OR Apache-2.0, used under MIT (https://github.com/wasm-bindgen/wasm-bindgen)
+wasm-bindgen-shared 0.2.129: MIT OR Apache-2.0, used under MIT (https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/shared)
+zerocopy 0.8.62: BSD-2-Clause OR Apache-2.0 OR MIT, used under MIT (https://github.com/google/zerocopy)
+zip 8.6.0: MIT (https://github.com/zip-rs/zip2)
+zip 9.0.2: MIT (https://github.com/zip-rs/zip2)
+zlib-rs 0.6.8: Zlib (https://github.com/trifectatechfoundation/zlib-rs)
+zopfli 0.8.3: Apache-2.0 (https://github.com/zopfli-rs/zopfli)
+
+================================================================================
+bitflags 2.13.2: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 The Rust Project Developers
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+bumpalo 3.20.3: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2019 Nick Fitzgerald
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+bytemuck 1.25.2: LICENSE-MIT
+================================================================================
+
+MIT License
+
+Copyright (c) 2019 Daniel "Lokathor" Gee.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+================================================================================
+cfg-if 1.0.5: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 Alex Crichton
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+crc32fast 1.5.2: LICENSE-MIT
+================================================================================
+
+MIT License
+
+Copyright (c) 2018 Sam Rijs, Alex Crichton and contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+derive_more 2.1.1: LICENSE
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2016 Jelte Fennema
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+equivalent 1.0.2: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2016--2023
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+flate2 1.1.10: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014-2026 Alex Crichton
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+half 2.7.1: LICENSE-MIT
+================================================================================
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+hashbrown 0.17.1: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2016 Amanieu d'Antras
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+indexmap 2.14.2: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2016--2017
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+libm 0.2.16: LICENSE.txt
+================================================================================
+
+rust-lang/libm as a whole is available for use under the MIT license:
+
+------------------------------------------------------------------------------
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+------------------------------------------------------------------------------
+
+As a contributor, you agree that your code can be used under either the MIT
+license or the Apache-2.0 license:
+
+------------------------------------------------------------------------------
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+------------------------------------------------------------------------------
+
+This Rust library contains the following copyrights:
+
+    Copyright (c) 2018 Jorge Aparicio
+
+Portions of this software are derived from third-party works licensed under
+terms compatible with the above MIT license:
+
+* musl libc https://www.musl-libc.org/. This library contains the following
+  copyright:
+
+      Copyright © 2005-2020 Rich Felker, et al.
+
+* The CORE-MATH project https://core-math.gitlabpages.inria.fr/. CORE-MATH
+  routines are available under the MIT license on a per-file basis.
+
+The musl libc COPYRIGHT file also includes the following notice relevant to
+math portions of the library:
+
+------------------------------------------------------------------------------
+Much of the math library code (src/math/* and src/complex/*) is
+Copyright © 1993,2004 Sun Microsystems or
+Copyright © 2003-2011 David Schultz or
+Copyright © 2003-2009 Steven G. Kargl or
+Copyright © 2003-2009 Bruce D. Evans or
+Copyright © 2008 Stephen L. Moshier or
+Copyright © 2017-2018 Arm Limited
+and labelled as such in comments in the individual source files. All
+have been licensed under extremely permissive terms.
+------------------------------------------------------------------------------
+
+Copyright notices are retained in src/* files where relevant.
+
+================================================================================
+log 0.4.34: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 The Rust Project Developers
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+logos 0.16.1: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2018 Maciej Hirsz <maciej.hirsz@gmail.com>
+
+The MIT License (MIT)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+lz4_flex 0.14.0: LICENSE
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2020 Pascal Seitz
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+================================================================================
+memchr 2.8.3: LICENSE-MIT
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2015 Andrew Gallant
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+================================================================================
+num-traits 0.2.19: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 The Rust Project Developers
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+once_cell 1.21.4: LICENSE-MIT
+================================================================================
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+openusd 0.8.0: LICENSE
+================================================================================
+
+MIT License
+
+Copyright (c) 2024 Maksym Pavlenko
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+openusd-schemas 0.8.0: LICENSE
+================================================================================
+
+MIT License
+
+Copyright (c) 2024 Maksym Pavlenko
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+regex-lite 0.1.9: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 The Rust Project Developers
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+simd-adler32 0.3.10: LICENSE.md
+================================================================================
+
+MIT License
+
+Copyright (c) [2021] [Marvin Countryman]
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+strum 0.28.0: LICENSE
+================================================================================
+
+MIT License
+
+Copyright (c) 2019 Peter Glotfelty
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+thiserror 2.0.21: LICENSE-MIT
+================================================================================
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+twox-hash 2.1.5: LICENSE.txt
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2015 Jake Goulding
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+typed-path 0.12.3: LICENSE-MIT
+================================================================================
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+unicode-ident 1.0.26: LICENSE-MIT
+================================================================================
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+unicode-ident 1.0.26: LICENSE-UNICODE
+================================================================================
+
+UNICODE LICENSE V3
+
+COPYRIGHT AND PERMISSION NOTICE
+
+Copyright © 1991-2023 Unicode, Inc.
+
+NOTICE TO USER: Carefully read the following legal agreement. BY
+DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR
+SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
+TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT
+DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of data files and any associated documentation (the "Data Files") or
+software and any associated documentation (the "Software") to deal in the
+Data Files or Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, and/or sell
+copies of the Data Files or Software, and to permit persons to whom the
+Data Files or Software are furnished to do so, provided that either (a)
+this copyright and permission notice appear with all copies of the Data
+Files or Software, or (b) this copyright and permission notice appear in
+associated Documentation.
+
+THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
+KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
+THIRD PARTY RIGHTS.
+
+IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE
+BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES,
+OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
+ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA
+FILES OR SOFTWARE.
+
+Except as contained in this notice, the name of a copyright holder shall
+not be used in advertising or otherwise to promote the sale, use or other
+dealings in these Data Files or Software without prior written
+authorization of the copyright holder.
+
+================================================================================
+wasm-bindgen 0.2.129: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 Alex Crichton
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+wasm-bindgen-shared 0.2.129: LICENSE-MIT
+================================================================================
+
+Copyright (c) 2014 Alex Crichton
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+zerocopy 0.8.62: LICENSE-MIT
+================================================================================
+
+Copyright 2023 The Fuchsia Authors
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+================================================================================
+zip 8.6.0: LICENSE
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2014 Mathijs van de Nes
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+zip 9.0.2: LICENSE
+================================================================================
+
+The MIT License (MIT)
+
+Copyright (c) 2014 Mathijs van de Nes
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+================================================================================
+zlib-rs 0.6.8: LICENSE
+================================================================================
+
+(C) 2024 Trifecta Tech Foundation 
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any damages
+arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute it
+freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must not
+   claim that you wrote the original software. If you use this software
+   in a product, an acknowledgment in the product documentation would be
+   appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and must not be
+   misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source distribution.
+
+================================================================================
+zopfli 0.8.3: COPYING
+================================================================================
+
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2011 Google Inc.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+
 ====================================================================================================
 ====================================================================================================
 NVIDIA packages (NVIDIA's own software in the bundle, listed for the record)