@driftengine/assets 3.63.0 → 4.1.0

package/NOTICE

@@ -7,3 +7,23 @@ This product includes software developed at Drift Technologies
 Licensed under the Apache License, Version 2.0. Section 4(d) of that licence
 requires this NOTICE to be reproduced in any derivative work you distribute,
 in the source, the documentation, or a display generated by the work.
+
+Models run by DriftCapture
+--------------------------
+DriftCapture runs the models below. Their weights are not in this repository
+and are not distributed with it: tools/capture-weights/ fetches each at the
+revision its manifest pins, verifies it, and converts it, and a game that
+ships one ships it under that model's own licence. Each model's definition in
+this engine is written from its project's published code.
+
+- Depth Anything 3 Small and Depth Anything 3 Base. Apache License 2.0.
+  Copyright (c) 2025 ByteDance Ltd. and/or its affiliates.
+- Depth Anything V2 Small. Apache License 2.0. The University of Hong Kong
+  and TikTok; converted to the Transformers layout by The HuggingFace Team.
+- MobileSAM. Apache License 2.0. Its image encoder is TinyViT, Copyright (c)
+  2022 Microsoft; its prompt encoder and mask decoder are Segment Anything's,
+  Copyright (c) Meta Platforms, Inc. and affiliates.
+- SAM 2.1 tiny. Apache License 2.0. Copyright (c) Meta Platforms, Inc. and
+  affiliates.
+- OWLv2 base patch16. Apache License 2.0. Copyright 2023 Google AI and The
+  HuggingFace Team.

package/dist/bake/cluster.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Splitting a mesh into clusters: the unit a GPU-driven frame culls, chooses detail for and draws.
+ *
+ * **A cluster is the unit of three separate decisions**, which is why its size is a parameter
+ * rather than a constant. Smaller clusters cull more precisely and pay more per-cluster overhead
+ * on every one of them; 128 triangles is the default because it is one workgroup of 128
+ * invocations doing one triangle each.
+ *
+ * **Growth is by shared vertices, and ties break on the lowest index.** That tie-break is not a
+ * detail: a baker whose output depends on iteration order produces a different container from the
+ * same source, which breaks every content hash downstream. The determinism test in this module's
+ * suite is what holds it.
+ *
+ * Each cluster carries a bounding sphere and a normal cone, because the runtime culls against both
+ * and computing them here costs nothing that the bake was not already paying.
+ */
+import type { MeshData } from '@driftengine/drft';
+export interface ClusterSet {
+    /** First triangle of each cluster, as an index into `indices` divided by three. */
+    triangleOffsets: Uint32Array;
+    /** How many triangles each cluster holds. */
+    triangleCounts: Uint32Array;
+    /** The mesh's indices, reordered so each cluster's triangles are contiguous. */
+    indices: Uint32Array;
+    /** Three floats per cluster. */
+    boundsCentre: Float32Array;
+    /** One float per cluster. */
+    boundsRadius: Float32Array;
+    /** Three floats per cluster: the average face normal, normalised. */
+    coneAxis: Float32Array;
+    /** One float per cluster: the minimum dot product of any face normal against the axis. */
+    coneCutoff: Float32Array;
+    count: number;
+}
+export interface ClusterOptions {
+    /**
+     * What makes two triangles neighbours while a cluster grows. **`'index'` by default**, which is
+     * what every baked container was hashed with and must go on producing.
+     *
+     * **`'position'` counts two corners as shared when they stand at the same point**, whatever their
+     * indices. A mesh that splits its vertices at every seam — a voxel mesher, whose faces each carry
+     * their own uv and occlusion, or a box built face by face — shares no index between two faces,
+     * so growth by index stops at every face and each quad becomes a cluster of two triangles: a
+     * median voxel chunk was 1,012 clusters for 2,024 triangles. The indices written out are still
+     * the mesh's own, because welding decides who is a neighbour and nothing else.
+     */
+    readonly share?: 'index' | 'position';
+}
+export declare function buildClusters(mesh: MeshData, target: number, options?: ClusterOptions): ClusterSet;

package/dist/bake/cluster.js

@@ -0,0 +1,277 @@
+/** Vertices shared between two triangles, each given as three vertex indices. */
+function shared(a, ai, b, bi) {
+    let count = 0;
+    for (let i = 0; i < 3; i += 1) {
+        const v = a[ai * 3 + i];
+        for (let j = 0; j < 3; j += 1)
+            if (v === b[bi * 3 + j])
+                count += 1;
+    }
+    return count;
+}
+function faceNormal(positions, indices, tri, out) {
+    const a = indices[tri * 3] * 3;
+    const b = indices[tri * 3 + 1] * 3;
+    const c = indices[tri * 3 + 2] * 3;
+    const ux = positions[b] - positions[a];
+    const uy = positions[b + 1] - positions[a + 1];
+    const uz = positions[b + 2] - positions[a + 2];
+    const vx = positions[c] - positions[a];
+    const vy = positions[c + 1] - positions[a + 1];
+    const vz = positions[c + 2] - positions[a + 2];
+    let nx = uy * vz - uz * vy;
+    let ny = uz * vx - ux * vz;
+    let nz = ux * vy - uy * vx;
+    const length = Math.hypot(nx, ny, nz);
+    if (length > 0) {
+        nx /= length;
+        ny /= length;
+        nz /= length;
+    }
+    out[0] = nx;
+    out[1] = ny;
+    out[2] = nz;
+}
+/**
+ * Every triangle touching each vertex, as a compressed row: offsets, then the triangles.
+ *
+ * **This is what makes the growth linear rather than cubic**, and the difference is not an
+ * optimisation. Growth picks the unassigned triangle sharing the most vertices with the cluster so
+ * far, and a triangle sharing none can never be picked — the loop stops when the best score is
+ * zero. So the only triangles worth considering are the ones reachable through a vertex, and this
+ * is the map that says which those are. Scanning the whole mesh to discover that answer is what
+ * the first version here did: 128 triangles took 16 ms, 2,048 took 1.9 s, 4,608 took 9.7 s, and a
+ * million-triangle asset extrapolated to days.
+ *
+ * Two passes and no arrays of arrays, because a million-triangle mesh is a million small
+ * allocations otherwise.
+ */
+function vertexTriangles(indices, vertices) {
+    const triangles = Math.floor(indices.length / 3);
+    const starts = new Uint32Array(vertices + 1);
+    for (let i = 0; i < triangles * 3; i += 1)
+        starts[indices[i] + 1] += 1;
+    for (let v = 0; v < vertices; v += 1) {
+        starts[v + 1] = starts[v + 1] + starts[v];
+    }
+    const cursor = Uint32Array.from(starts.subarray(0, vertices));
+    const list = new Uint32Array(triangles * 3);
+    for (let t = 0; t < triangles; t += 1) {
+        for (let corner = 0; corner < 3; corner += 1) {
+            const v = indices[t * 3 + corner];
+            list[cursor[v]] = t;
+            cursor[v] = cursor[v] + 1;
+        }
+    }
+    return { starts, list };
+}
+/**
+ * Each index replaced by the first vertex standing where it stands.
+ *
+ * **The first, in vertex order**, so the answer depends on the mesh and not on a hash table's
+ * iteration — which is the reproducibility the tie-break above is written for. Keyed on the
+ * numbers rather than their bits, so a corner at `-0` meets one at `0`.
+ */
+function canonicalIndices(indices, positions, vertices) {
+    const first = new Map();
+    const canonical = new Uint32Array(vertices);
+    for (let v = 0; v < vertices; v += 1) {
+        const key = `${positions[v * 3]},${positions[v * 3 + 1]},${positions[v * 3 + 2]}`;
+        const known = first.get(key);
+        if (known === undefined) {
+            first.set(key, v);
+            canonical[v] = v;
+        }
+        else {
+            canonical[v] = known;
+        }
+    }
+    return Uint32Array.from(indices, (index) => canonical[index]);
+}
+export function buildClusters(mesh, target, options = {}) {
+    const source = mesh.indices;
+    const triangles = Math.floor(source.length / 3);
+    const positions = mesh.positions;
+    const vertices = Math.floor(positions.length / 3);
+    const assigned = new Uint8Array(triangles);
+    const indices = new Uint32Array(source.length);
+    const offsets = [];
+    const counts = [];
+    /*
+     * **Who neighbours whom**, which is the source itself unless the caller asked for positions.
+     * Growth and scoring read this; what is written out reads `source`.
+     */
+    const linked = options.share === 'position' ? canonicalIndices(source, positions, vertices) : source;
+    const adjacency = vertexTriangles(linked, vertices);
+    const member = [];
+    /*
+     * The frontier: unassigned triangles that share at least one vertex with a member, and the best
+     * score each has against any member so far. `score` is indexed by triangle and is only read for
+     * triangles in `frontier`, so it never has to be cleared between clusters.
+     */
+    const frontier = [];
+    const score = new Uint8Array(triangles);
+    const queued = new Uint8Array(triangles);
+    let written = 0;
+    let placed = 0;
+    /* The lowest unassigned triangle seeds the next cluster, so the walk is reproducible. Monotone,
+       because every triangle below it is assigned — scanning from zero each time is a second
+       quadratic term hiding behind the first. */
+    let nextSeed = 0;
+    while (placed < triangles) {
+        while (nextSeed < triangles && assigned[nextSeed] === 1)
+            nextSeed += 1;
+        if (nextSeed >= triangles)
+            break;
+        const seed = nextSeed;
+        member.length = 0;
+        frontier.length = 0;
+        member.push(seed);
+        assigned[seed] = 1;
+        placed += 1;
+        offer(seed);
+        while (member.length < target) {
+            /*
+             * The best score, ties broken by the lowest triangle index — the same answer the whole-mesh
+             * scan gave, because it ran in index order and compared strictly greater. The frontier is
+             * not in index order, so the tie-break is written out rather than inherited from the loop.
+             */
+            let best = -1;
+            let bestScore = 0;
+            let live = 0;
+            for (let i = 0; i < frontier.length; i += 1) {
+                const t = frontier[i];
+                if (assigned[t] === 1) {
+                    queued[t] = 0;
+                    continue;
+                }
+                /* Compacted in place as it is scanned, so a consumed frontier entry is not walked again. */
+                frontier[live] = t;
+                live += 1;
+                const s = score[t];
+                if (s > bestScore || (s === bestScore && best >= 0 && t < best)) {
+                    bestScore = s;
+                    best = t;
+                }
+            }
+            frontier.length = live;
+            if (best === -1 || bestScore <= 0)
+                break;
+            member.push(best);
+            assigned[best] = 1;
+            placed += 1;
+            offer(best);
+        }
+        /*
+         * **`queued` is per cluster and the frontier is where it is recorded.** Leaving a triangle
+         * marked from a cluster that never took it makes it invisible to every cluster afterwards —
+         * `offer` would update its score and never put it on the new frontier — and what that looks
+         * like is growth stopping early everywhere: 25,088 triangles came out as 11,860 clusters
+         * rather than 196.
+         *
+         * **The frontier alone is enough and a second loop over the members is not.** Every member
+         * except the seed was offered before it was chosen, so it is in this array; the seed was
+         * already assigned when its own `offer` ran and was never marked. A loop over the members
+         * stood here and a perturbation survived it.
+         */
+        for (const t of frontier)
+            queued[t] = 0;
+        offsets.push(written / 3);
+        counts.push(member.length);
+        for (const t of member) {
+            indices[written] = source[t * 3];
+            indices[written + 1] = source[t * 3 + 1];
+            indices[written + 2] = source[t * 3 + 2];
+            written += 3;
+        }
+    }
+    /** Raise every neighbour of a new member to the score it now has against the cluster. */
+    function offer(added) {
+        for (let corner = 0; corner < 3; corner += 1) {
+            const v = linked[added * 3 + corner];
+            const from = adjacency.starts[v];
+            const to = adjacency.starts[v + 1];
+            for (let i = from; i < to; i += 1) {
+                const t = adjacency.list[i];
+                /* Already in a cluster. The frontier scan refuses it again, so deleting this changes
+                   no answer — it is a cost guard, and the cost is 105 ms against 89 ms over a mesh of
+                   100,352 triangles, which is an eighteenth of the bake. A perturbation survives it. */
+                if (assigned[t] === 1)
+                    continue;
+                const shares = shared(linked, added, linked, t);
+                if (queued[t] === 0) {
+                    queued[t] = 1;
+                    score[t] = shares;
+                    frontier.push(t);
+                }
+                else if (shares > score[t]) {
+                    score[t] = shares;
+                }
+            }
+        }
+    }
+    const count = offsets.length;
+    const set = {
+        triangleOffsets: Uint32Array.from(offsets),
+        triangleCounts: Uint32Array.from(counts),
+        indices,
+        boundsCentre: new Float32Array(count * 3),
+        boundsRadius: new Float32Array(count),
+        coneAxis: new Float32Array(count * 3),
+        coneCutoff: new Float32Array(count),
+        count,
+    };
+    const normal = new Float32Array(3);
+    for (let c = 0; c < count; c += 1) {
+        const at = set.triangleOffsets[c];
+        const n = set.triangleCounts[c];
+        let cx = 0;
+        let cy = 0;
+        let cz = 0;
+        let vertices = 0;
+        for (let i = at * 3; i < (at + n) * 3; i += 1) {
+            const v = indices[i] * 3;
+            cx += positions[v];
+            cy += positions[v + 1];
+            cz += positions[v + 2];
+            vertices += 1;
+        }
+        cx /= vertices;
+        cy /= vertices;
+        cz /= vertices;
+        let radius = 0;
+        for (let i = at * 3; i < (at + n) * 3; i += 1) {
+            const v = indices[i] * 3;
+            radius = Math.max(radius, Math.hypot(positions[v] - cx, positions[v + 1] - cy, positions[v + 2] - cz));
+        }
+        let ax = 0;
+        let ay = 0;
+        let az = 0;
+        for (let t = at; t < at + n; t += 1) {
+            faceNormal(positions, indices, t, normal);
+            ax += normal[0];
+            ay += normal[1];
+            az += normal[2];
+        }
+        const axisLength = Math.hypot(ax, ay, az);
+        if (axisLength > 0) {
+            ax /= axisLength;
+            ay /= axisLength;
+            az /= axisLength;
+        }
+        let cutoff = 1;
+        for (let t = at; t < at + n; t += 1) {
+            faceNormal(positions, indices, t, normal);
+            cutoff = Math.min(cutoff, normal[0] * ax + normal[1] * ay + normal[2] * az);
+        }
+        set.boundsCentre[c * 3] = cx;
+        set.boundsCentre[c * 3 + 1] = cy;
+        set.boundsCentre[c * 3 + 2] = cz;
+        set.boundsRadius[c] = radius;
+        set.coneAxis[c * 3] = ax;
+        set.coneAxis[c * 3 + 1] = ay;
+        set.coneAxis[c * 3 + 2] = az;
+        set.coneCutoff[c] = cutoff;
+    }
+    return set;
+}

package/dist/bake/clusterLod.d.ts

@@ -0,0 +1,40 @@
+/**
+ * The level-of-detail graph over a mesh's clusters, and the property the whole pipeline rests on.
+ *
+ * **A cluster's own error must never exceed its parent's.** Given that, a cut chosen independently
+ * per cluster — draw this one if its projected error is under the threshold, otherwise ask its
+ * parent — is guaranteed crack-free, because two adjacent clusters can never choose levels whose
+ * shared edge was simplified differently. Without it the pipeline draws holes, and the holes appear
+ * at viewing distances nobody tested. The property holds here **by construction**: each level's
+ * error is forced up to at least its children's maximum.
+ *
+ * **Simplification is vertex clustering on a grid, not edge collapse, and that is a deliberate
+ * first implementation.** Grid snapping is deterministic without a tie-break argument, needs no
+ * dependency, and — the part that matters — has an error bound that is *known in advance* rather
+ * than measured after the fact: no vertex moves further than half a cell diagonal. A quadric edge
+ * collapse would give a better-looking result at the same triangle count and would have to
+ * measure its error to keep the invariant above. The graph shape, the error discipline and every
+ * consumer of both are identical either way, so the better simplifier is a drop-in replacement
+ * for `simplifyGroup` and nothing else.
+ */
+import type { MeshData } from '@driftengine/drft';
+import type { ClusterSet } from './cluster.ts';
+export interface ClusterLevel {
+    /** The clusters at this level. Level 0 is the source mesh's. */
+    set: ClusterSet;
+    /** Positions the level's indices address. Level 0 shares the source mesh's. */
+    positions: Float32Array;
+    /** Geometric error each cluster at this level carries. Zero at level 0. */
+    ownError: Float32Array;
+    /** The error of the group that replaces this cluster one level up, or Infinity at the root. */
+    parentError: Float32Array;
+    /** Which group of this level was simplified together. Clusters sharing one share a parent. */
+    groupOf: Uint32Array;
+}
+export interface ClusterDag {
+    levels: ClusterLevel[];
+}
+export declare function buildClusterDag(set: ClusterSet, mesh: MeshData, options?: {
+    target?: number;
+    maxLevels?: number;
+}): ClusterDag;

package/dist/bake/clusterLod.js

@@ -0,0 +1,162 @@
+import { buildClusters } from './cluster.js';
+/**
+ * The mean length of a triangle edge, which is the mesh's own sense of how far apart its detail is.
+ *
+ * Sampled over every triangle rather than every unique edge: each interior edge is counted twice
+ * and each boundary edge once, which biases the mean by a fraction of a percent on any mesh large
+ * enough to matter and saves building an edge set.
+ */
+function meanEdgeLength(positions, indices) {
+    let total = 0;
+    let count = 0;
+    for (let t = 0; t < indices.length / 3; t += 1) {
+        for (let e = 0; e < 3; e += 1) {
+            const a = indices[t * 3 + e] * 3;
+            const b = indices[t * 3 + ((e + 1) % 3)] * 3;
+            total += Math.hypot(positions[b] - positions[a], positions[b + 1] - positions[a + 1], positions[b + 2] - positions[a + 2]);
+            count += 1;
+        }
+    }
+    return count === 0 ? 0 : total / count;
+}
+/** How far a vertex can move when snapped to a grid of this size: half the cell diagonal. */
+function snapError(cell) {
+    return (cell * Math.sqrt(3)) / 2;
+}
+/**
+ * Collapse a group's triangles by snapping vertices to a grid and dropping what degenerates.
+ *
+ * Returns the surviving geometry and the error bound, which is a property of the grid rather than
+ * a measurement of the result — see the header for why that matters.
+ */
+function simplifyGroup(positions, indices, cell) {
+    const keyOf = new Map();
+    const remap = new Map();
+    const out = [];
+    for (let i = 0; i < indices.length; i += 1) {
+        const v = indices[i];
+        if (remap.has(v))
+            continue;
+        const at = v * 3;
+        const gx = Math.round(positions[at] / cell);
+        const gy = Math.round(positions[at + 1] / cell);
+        const gz = Math.round(positions[at + 2] / cell);
+        const key = `${gx},${gy},${gz}`;
+        let slot = keyOf.get(key);
+        if (slot === undefined) {
+            slot = out.length / 3;
+            keyOf.set(key, slot);
+            out.push(gx * cell, gy * cell, gz * cell);
+        }
+        remap.set(v, slot);
+    }
+    const kept = [];
+    for (let t = 0; t < indices.length / 3; t += 1) {
+        const a = remap.get(indices[t * 3]);
+        const b = remap.get(indices[t * 3 + 1]);
+        const c = remap.get(indices[t * 3 + 2]);
+        /* A triangle whose corners snapped together has no area and is dropped, not kept flat. */
+        if (a === b || b === c || a === c)
+            continue;
+        kept.push(a, b, c);
+    }
+    return {
+        positions: Float32Array.from(out),
+        indices: Uint32Array.from(kept),
+        error: snapError(cell),
+    };
+}
+/**
+ * Group clusters for simplification, by proximity, `size` at a time.
+ *
+ * Ordered by cluster index rather than by a spatial sort, then filled greedily from the nearest
+ * unassigned centroid — deterministic, and close enough to spatial that groups are contiguous on
+ * ordinary geometry. Clusters in one group are simplified together, so edges interior to the group
+ * may collapse and edges on its boundary may not.
+ */
+function groupClusters(set, size) {
+    const groupOf = new Uint32Array(set.count).fill(0xffffffff);
+    let group = 0;
+    for (let seed = 0; seed < set.count; seed += 1) {
+        if (groupOf[seed] !== 0xffffffff)
+            continue;
+        groupOf[seed] = group;
+        let taken = 1;
+        while (taken < size) {
+            let best = -1;
+            let bestDistance = Infinity;
+            for (let c = 0; c < set.count; c += 1) {
+                if (groupOf[c] !== 0xffffffff)
+                    continue;
+                const d = Math.hypot(set.boundsCentre[c * 3] - set.boundsCentre[seed * 3], set.boundsCentre[c * 3 + 1] - set.boundsCentre[seed * 3 + 1], set.boundsCentre[c * 3 + 2] - set.boundsCentre[seed * 3 + 2]);
+                if (d < bestDistance) {
+                    bestDistance = d;
+                    best = c;
+                }
+            }
+            if (best === -1)
+                break;
+            groupOf[best] = group;
+            taken += 1;
+        }
+        group += 1;
+    }
+    return groupOf;
+}
+const GROUP_SIZE = 4;
+export function buildClusterDag(set, mesh, options = {}) {
+    const target = options.target ?? 128;
+    const maxLevels = options.maxLevels ?? 8;
+    const levels = [];
+    let currentSet = set;
+    let currentPositions = mesh.positions;
+    let currentError = new Float32Array(set.count);
+    /*
+     * The starting cell comes from the mesh's own edge length, not from its extent.
+     *
+     * Derived from the extent it is arbitrary, and arbitrary here means wrong in a way that looks
+     * like the algorithm failing: a cell finer than the vertex spacing merges nothing, the triangle
+     * count does not fall, and the build stops at one level believing the mesh cannot be
+     * simplified. Starting a little above the mean edge collapses neighbouring vertices on the
+     * first pass, which is what the doubling then builds on.
+     */
+    let cell = Math.max(1e-3, meanEdgeLength(mesh.positions, set.indices) * 1.5);
+    for (let level = 0; level < maxLevels; level += 1) {
+        const groupOf = groupClusters(currentSet, GROUP_SIZE);
+        const parentError = new Float32Array(currentSet.count);
+        const last = currentSet.count <= 1;
+        if (last) {
+            parentError.fill(Infinity);
+            levels.push({
+                set: currentSet,
+                positions: currentPositions,
+                ownError: currentError,
+                parentError,
+                groupOf,
+            });
+            break;
+        }
+        /* Every cluster of a group takes the group's error, so two in one group cannot disagree. */
+        const error = Math.max(snapError(cell), ...Array.from(currentError));
+        for (let c = 0; c < currentSet.count; c += 1)
+            parentError[c] = error;
+        levels.push({
+            set: currentSet,
+            positions: currentPositions,
+            ownError: currentError,
+            parentError,
+            groupOf,
+        });
+        const simplified = simplifyGroup(currentPositions, currentSet.indices, cell);
+        if (simplified.indices.length === 0 || simplified.indices.length >= currentSet.indices.length) {
+            break;
+        }
+        const nextMesh = { ...mesh, positions: simplified.positions, indices: simplified.indices };
+        const nextSet = buildClusters(nextMesh, target);
+        currentSet = nextSet;
+        currentPositions = simplified.positions;
+        currentError = new Float32Array(nextSet.count).fill(error);
+        cell *= 2;
+    }
+    return { levels };
+}

package/dist/bake/dtexChunk.d.ts

@@ -0,0 +1,52 @@
+/**
+ * An encoded material as the chunk a file carries it in.
+ *
+ * **The join between two packages that cannot see each other.** `@driftengine/assets` knows how to
+ * encode a material — a latent, a small network and a decode program — and `@driftengine/drft` knows
+ * how to store bytes and nothing about what they mean. This is the one place that knows both, and
+ * it is deliberately thin: it moves fields and packs a channel's semantic into a word.
+ *
+ * **The channels are the one thing the encoding does not already carry.** `EncodedMaterial` holds
+ * the latent, the weights and the graph, and the graph is two nodes — sample, then evaluate. What
+ * a channel *means* lives in the `ChannelSpec`s the caller handed `encodeMaterial`, so they are
+ * handed over again here rather than recovered from a program that never held them.
+ *
+ * **The tiles are the caller's dedup, not this function's.** Two materials in a bake share a tile
+ * whenever their bytes match, which is a decision across the whole bake; a function given one
+ * material cannot make it. A caller with no tiling hands over none and the chunk carries its latent
+ * as one run, which is what a small material wants anyway.
+ */
+import type { DtexMaterial } from '@driftengine/drft';
+import { type ChannelSpec } from '@driftengine/texture';
+import type { EncodedMaterial } from './latent.ts';
+/** Where each tile's bytes sit in the latent payload, and what they hash to. */
+export interface DtexTiles {
+    readonly offset: Uint32Array;
+    readonly length: Uint32Array;
+    /** Two words a tile, high first, as `hashTile` splits its 64 bits. */
+    readonly hash: Uint32Array;
+    /** The payload the offsets index: tile-major, each tile's bytes in one run. */
+    readonly payload: Uint8Array;
+}
+/**
+ * A latent cut into tiles, in the grid's order, with identical tiles sharing one run.
+ *
+ * **Tile-major, because a tile of a row-major image is not contiguous** — its rows are a stride
+ * apart, so no offset and length can name one, which is why the table this replaces could not be
+ * written. Cut across a row and then down, the order `@driftengine/texture`'s `latentTileGrid`
+ * uses, so the entry for a tile is `ty * across + tx` and a reader with a coordinate can find it.
+ *
+ * **Deduplicated by content**, which is the whole reason the hash is in the file: a flat surface
+ * tiles into hundreds of identical squares, and a material that stored each of them separately
+ * would pay for the flatness. Two tiles with the same bytes get the same offset and length.
+ */
+export declare function cutLatentTiles(latent: Uint8Array, width: number, height: number, components: number, tileSize: number): DtexTiles;
+/**
+ * `encoded` as a `DtexMaterial`, with `channels` saying what each of its outputs is.
+ *
+ * A channel is packed as `(semanticIndex << 4) | component`, which is what the decode interpreter
+ * unpacks and what the chunk stores. **A semantic this build does not know is refused** rather than
+ * written as something else: the index is the format's, and a wrong one is a channel that decodes
+ * as another channel, which reads as a shading fault in a scene nobody has changed.
+ */
+export declare function dtexFromEncoded(encoded: EncodedMaterial, channels: readonly ChannelSpec[], tileSize?: number): DtexMaterial;