@driftengine/texture 4.0.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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 2026 Drift Technologies
+
+   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.

package/NOTICE

@@ -0,0 +1,29 @@
+DriftEngine
+Copyright 2026 Drift Technologies
+
+This product includes software developed at Drift Technologies
+(https://github.com/drftrun/driftengine).
+
+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/README.md

@@ -0,0 +1,106 @@
+# `@driftengine/texture`
+
+A texture as a compiled, sampled field rather than an image.
+
+**Cost: 2,305 bytes gzipped, standalone** — 2,226 of code and 79 for the licence banner every
+package carries. Measured by `scripts/size-gate.test.mjs`, which fails if
+it drifts more than 3%. The package imports no renderer, so this is the whole of what a consumer
+pays — there is no core in the number.
+
+**The interpreter that runs a decode graph on the device is not in this package.** It lives in
+`@driftengine/core`'s GPU-driven pass as `DECODE_WGSL`, and `scripts/gpu-parity.mjs` checks it
+against `decodeCpu` on a real texture array and real samplers, over all nine operations and all four
+address modes.
+
+```ts
+import { createDecodeGraph, addDecodeNode, DECODE_OP, decodeCpu } from '@driftengine/texture';
+
+const graph = createDecodeGraph(4);
+addDecodeNode(graph, DECODE_OP.SAMPLE_LATENT, 0, 0, 0);
+addDecodeNode(graph, DECODE_OP.REMAP_CHANNEL, 0, (0 << 4) | 0, 1); // albedo-srgb, component 0
+graph.result = 1;
+
+decodeCpu(graph, resources, u, v, simulationTime, out, registers);
+```
+
+## What makes it different from an image
+
+**One object per material, not per channel.** Albedo, normal, roughness and the rest are strongly
+correlated, and every engine in the world compresses them apart — which throws that correlation
+away before it can pay for anything.
+
+**Time is an argument, not a clock.** `decodeCpu` takes `t` from the caller, which is the
+simulation's clock. So an animated texture is byte-exact under replay. Every other engine's
+animated texture reads a wall clock, which means replaying one simulation twice shows different
+texels — invisible in a game, fatal in a rollback session, a deterministic capture, or an
+automated visual comparison.
+
+**The decoder is data, not a shader permutation.** A decode graph is four words per node in a
+uniform buffer, walked by one shader. `docs/ARCHITECTURE.md` records what the other choice costs
+with the number: a fifth permutation flag took the generated WGSL corpus from 914 KB to 1,906 KB
+and cost 196,910 gzipped bytes on every consumer, including those who never enabled the feature.
+Per material rather than per feature, that does not survive contact with a real project.
+
+**Conventions are declared, so nothing downstream guesses.** A channel says it is a Y-down
+tangent-space normal, or an sRGB albedo, or gloss — and comes back Y-up, linear, and as roughness.
+The exact sRGB curve, not the 2.2 approximation: the midpoint linearises to 0.2140, and the
+approximation's 0.2176 is a colour shift nobody attributes to the right cause for weeks.
+
+**Normal mips get rougher instead of sparkling.** Averaging four normals and renormalising discards
+how much they disagreed, and that disagreement _is_ roughness at the smaller scale. Preserving it
+needs the mip chain to write roughness as well as normals, which needs both in one object.
+
+**Materials bind as array slices.** WebGPU has no bindless access, so a thousand materials as six
+thousand textures is unreachable; a thousand latent slices in a handful of arrays, indexed from a
+storage buffer, is ordinary. Identical content shares a layer.
+
+**Two address conventions, because two kinds of data need them.** A lattice puts `u = 0` on the
+first texel's centre, which is what a height field sampled at its own vertices wants; a centre mode
+puts it on the first texel's edge, which is what every GPU sampler does and what a surface tiled
+across a mesh wants. `ADDRESS_MODE` names all four, and `decodeCpu` takes a mip level as well, so
+the device's trilinear sample has a reference at every level.
+
+## What a predicted view needs
+
+**Prediction knows where the camera will be; `tilesForView` says what it will sample there.** For
+each instance whose bounds are inside the predicted view, the level comes from its nearest point —
+where the surface is finest on screen — and the tiles from its texture coordinates' span at that
+level. It names the finer level too within an eighth of a level of a boundary, and every coarser
+level, because a sampler with a fine tile missing falls back to a coarse one. An estimate is
+enough: a tile it names that the frame does not sample is a wasted fetch.
+
+```ts
+import {
+  TILE_RESIDENT,
+  enqueue,
+  latentTileGrid,
+  runPrediction,
+  tileState,
+  tilesForView,
+} from '@driftengine/texture';
+
+const grid = latentTileGrid(latent, 16, graph.addressMode); // content-addressed, level by level
+runPrediction(
+  simulation,
+  {
+    needs: (view, out, budget) => tilesForView(view, projection, scene, out, budget),
+    resident: (hash) => tileState(table, hash) === TILE_RESIDENT,
+    request: (hash, priority) => enqueue(queue, hash, priority),
+  },
+  6,
+  step,
+  512,
+);
+```
+
+The answer is ordered by the screen each tile covers, and at any budget it is a prefix of the answer
+with none; `runPrediction` keeps that order inside each predicted frame when it hands tiles to the
+queue. `popIn.test.ts` flies a corridor of real latents through it: nothing is late after the three
+frames no fetch could have reached.
+
+## What is not here
+
+**The offline joint encoder is not in this package, by design**: it is a baker, and it lives in
+`@driftengine/assets` as `encodeMaterial`, so a game that only decodes never carries it. The `NNET`
+weights chunk is `@driftengine/drft`'s, and the half-precision network reference is here beside the
+single-precision one, as `evalNetworkHalf`.

package/dist/decodeCpu.d.ts

@@ -0,0 +1,59 @@
+import type { DecodeGraph } from './decodeGraph.ts';
+import type { NetworkShape } from './inference.ts';
+import type { ChannelSemantic } from './semantics.ts';
+/** One level of a latent's chain. Components are the image's own. */
+export interface LatentLevel {
+    data: Float32Array;
+    width: number;
+    height: number;
+}
+export interface LatentImage {
+    data: Float32Array;
+    width: number;
+    height: number;
+    /** Components per texel, up to four. */
+    channels: number;
+    /**
+     * Levels 1 onward, each half the one before. `mips[k]` is level `k + 1`.
+     *
+     * Absent is a single level, which is every image written before 2026-09-17 — and at `lod` 0 the
+     * chain is never read, so those callers decode exactly what they did.
+     */
+    mips?: readonly LatentLevel[];
+}
+export interface DecodeResources {
+    latents: readonly LatentImage[];
+    blocks: readonly LatentImage[];
+    networks: readonly {
+        shape: NetworkShape;
+        weights: Float32Array;
+    }[];
+    /**
+     * Four floats per slot, for `CONSTANT`.
+     *
+     * Optional, so every caller written before Wave 4C still type-checks and still runs — a graph
+     * with no constant in it never reads this.
+     */
+    constants?: Float32Array;
+}
+/**
+ * The order `REMAP_CHANNEL` packs a semantic in, which is `CHANNEL_SEMANTICS` and not a copy of it.
+ *
+ * **It was a copy until 2026-09-20**, written out again here — the same eleven names in the same
+ * order in two files, with nothing holding them together. That is a list a file's channels are
+ * *numbered* by: the two drifting apart means every material written by one and read by the other
+ * decodes its channels as something else, and a normal map read as roughness inverts every
+ * highlight in a scene. The name is kept because `terrainTexture.ts`, the WGSL interpreter's test
+ * and this file all say `REMAP_SEMANTICS` when they mean the packing.
+ */
+export declare const REMAP_SEMANTICS: readonly ChannelSemantic[];
+/**
+ * Run the graph at one texture coordinate and one time, writing four components into `out`.
+ *
+ * `registers` is the caller's, `MAX_REGISTERS * 4` floats, reused so this allocates nothing.
+ * `lod` picks the level a latent is sampled at; 0, and anything that is not a positive number, is
+ * level 0.
+ */
+export declare function decodeCpu(graph: DecodeGraph, resources: DecodeResources, u: number, v: number, t: number, out: Float32Array, registers: Float32Array, lod?: number): void;
+/** A registers array of the right size, for a caller that holds one across calls. */
+export declare function createDecodeRegisters(): Float32Array;

package/dist/decodeCpu.js

@@ -0,0 +1,234 @@
+/**
+ * The reference decoder: what the shader has to agree with.
+ *
+ * **A second implementation is not duplication here, it is the specification.** A shader cannot be
+ * unit-tested at speed, and a decoder that is subtly wrong is a picture that is subtly wrong
+ * everywhere — the hardest defect in this whole design to notice and the easiest to ship. So the
+ * arithmetic is written once in TypeScript, where it can be asserted in milliseconds, and the
+ * device copy is checked against it over generated input.
+ *
+ * The repository already takes this position: `splats` authors its shader once and generates the
+ * second backend from it. This is the same discipline where the second copy cannot be generated.
+ *
+ * **Deterministic by construction.** No clock, no random, and `t` is the caller's. Decoding the
+ * same inputs twice is bit-identical, which is what the fingerprint test rests on.
+ */
+import { ADDRESS_MODE, DECODE_OP, MAX_REGISTERS, nodeA, nodeB, nodeOp, nodeOut, } from './decodeGraph.js';
+import { evalNetwork } from './inference.js';
+import { CHANNEL_SEMANTICS, normaliseSample } from './semantics.js';
+import { flipbookFrame } from './timeNodes.js';
+/**
+ * The order `REMAP_CHANNEL` packs a semantic in, which is `CHANNEL_SEMANTICS` and not a copy of it.
+ *
+ * **It was a copy until 2026-09-20**, written out again here — the same eleven names in the same
+ * order in two files, with nothing holding them together. That is a list a file's channels are
+ * *numbered* by: the two drifting apart means every material written by one and read by the other
+ * decodes its channels as something else, and a normal map read as roughness inverts every
+ * highlight in a scene. The name is kept because `terrainTexture.ts`, the WGSL interpreter's test
+ * and this file all say `REMAP_SEMANTICS` when they mean the packing.
+ */
+export const REMAP_SEMANTICS = CHANNEL_SEMANTICS;
+/** Lattice addressing only: where a coordinate lands before it is scaled across the lattice. */
+function address(value, mode) {
+    if (mode === ADDRESS_MODE.LATTICE_WRAP)
+        return value - Math.floor(value);
+    return Math.min(1, Math.max(0, value));
+}
+/** A texel index inside the image: wrapped for centre wrap, clamped for everything else. */
+function texelIndex(value, size, mode) {
+    if (mode === ADDRESS_MODE.CENTRE_WRAP)
+        return ((value % size) + size) % size;
+    return Math.min(size - 1, Math.max(0, value));
+}
+/**
+ * Bilinear on one level, with the graph's address mode applied first.
+ *
+ * **For the lattice modes this is byte-identical to what it replaced**: `su` is inside
+ * `[0, width - 1]`, so clamping `floor(su)` and `floor(su) + 1` is exactly the `min` it was.
+ */
+function sampleLevel(level, channels, u, v, mode, out) {
+    const centre = mode === ADDRESS_MODE.CENTRE_CLAMP || mode === ADDRESS_MODE.CENTRE_WRAP;
+    const su = centre ? u * level.width - 0.5 : address(u, mode) * (level.width - 1);
+    const sv = centre ? v * level.height - 0.5 : address(v, mode) * (level.height - 1);
+    const baseX = Math.floor(su);
+    const baseY = Math.floor(sv);
+    const fx = su - baseX;
+    const fy = sv - baseY;
+    const x0 = texelIndex(baseX, level.width, mode);
+    const x1 = texelIndex(baseX + 1, level.width, mode);
+    const y0 = texelIndex(baseY, level.height, mode);
+    const y1 = texelIndex(baseY + 1, level.height, mode);
+    for (let c = 0; c < 4; c += 1) {
+        if (c >= channels) {
+            out[c] = c === 3 ? 1 : 0;
+            continue;
+        }
+        const at = (x, y) => level.data[(y * level.width + x) * channels + c];
+        const top = at(x0, y0) * (1 - fx) + at(x1, y0) * fx;
+        const bottom = at(x0, y1) * (1 - fx) + at(x1, y1) * fx;
+        out[c] = top * (1 - fy) + bottom * fy;
+    }
+}
+const SECOND = new Float32Array(4);
+/**
+ * Trilinear: bilinear on the two levels either side of `lod`, mixed by its fraction.
+ *
+ * **At a whole level only that level is read**, so an integer `lod` — and 0 above all — costs and
+ * returns exactly one bilinear sample.
+ */
+function sampleImage(image, u, v, mode, lod, out) {
+    const top = image.mips?.length ?? 0;
+    const level = lod > 0 ? Math.min(lod, top) : 0;
+    const lower = Math.floor(level);
+    const blend = level - lower;
+    const levelOf = (k) => k === 0 ? image : image.mips?.[k - 1];
+    sampleLevel(levelOf(lower), image.channels, u, v, mode, out);
+    if (blend === 0)
+        return;
+    sampleLevel(levelOf(Math.min(lower + 1, top)), image.channels, u, v, mode, SECOND);
+    for (let c = 0; c < 4; c += 1) {
+        out[c] = out[c] * (1 - blend) + SECOND[c] * blend;
+    }
+}
+/** A deterministic integer hash, so the procedural node reproduces across runs and platforms. */
+function hash2(x, y, seed) {
+    let h = Math.imul(x | 0, 0x27d4eb2d) ^ Math.imul(y | 0, 0x165667b1) ^ Math.imul(seed | 0, 0x9e3779b1);
+    h = Math.imul(h ^ (h >>> 15), 0x2c1b3c6d);
+    h = Math.imul(h ^ (h >>> 12), 0x297a2d39);
+    return ((h ^ (h >>> 15)) >>> 0) / 0xffffffff;
+}
+function valueNoise(u, v, seed) {
+    const x0 = Math.floor(u);
+    const y0 = Math.floor(v);
+    const fx = u - x0;
+    const fy = v - y0;
+    const sx = fx * fx * (3 - 2 * fx);
+    const sy = fy * fy * (3 - 2 * fy);
+    const a = hash2(x0, y0, seed);
+    const b = hash2(x0 + 1, y0, seed);
+    const c = hash2(x0, y0 + 1, seed);
+    const d = hash2(x0 + 1, y0 + 1, seed);
+    return (a * (1 - sx) + b * sx) * (1 - sy) + (c * (1 - sx) + d * sx) * sy;
+}
+const SCRATCH = new Float32Array(256);
+const SAMPLE = new Float32Array(4);
+const NET_IN = new Float32Array(64);
+const NET_OUT = new Float32Array(64);
+/**
+ * Run the graph at one texture coordinate and one time, writing four components into `out`.
+ *
+ * `registers` is the caller's, `MAX_REGISTERS * 4` floats, reused so this allocates nothing.
+ * `lod` picks the level a latent is sampled at; 0, and anything that is not a positive number, is
+ * level 0.
+ */
+export function decodeCpu(graph, resources, u, v, t, out, registers, lod = 0) {
+    for (let i = 0; i < graph.count; i += 1) {
+        const op = nodeOp(graph, i);
+        const a = nodeA(graph, i);
+        const b = nodeB(graph, i);
+        const dst = nodeOut(graph, i) * 4;
+        switch (op) {
+            case DECODE_OP.CONSTANT: {
+                const constants = resources.constants;
+                const base = a * 4;
+                for (let c = 0; c < 4; c += 1)
+                    registers[dst + c] = constants?.[base + c] ?? 0;
+                break;
+            }
+            case DECODE_OP.SAMPLE_LATENT: {
+                const image = resources.latents[a];
+                if (image === undefined)
+                    break;
+                sampleImage(image, u, v, graph.addressMode, lod, SAMPLE);
+                registers.set(SAMPLE, dst);
+                break;
+            }
+            case DECODE_OP.SAMPLE_BLOCK: {
+                const image = resources.blocks[a];
+                if (image === undefined)
+                    break;
+                sampleImage(image, u, v, graph.addressMode, lod, SAMPLE);
+                registers.set(SAMPLE, dst);
+                break;
+            }
+            case DECODE_OP.PROCEDURAL_FBM: {
+                let sum = 0;
+                let amplitude = 0.5;
+                let frequency = 1;
+                const octaves = Math.max(1, b);
+                for (let o = 0; o < octaves; o += 1) {
+                    sum += valueNoise(u * frequency * 8, v * frequency * 8, a) * amplitude;
+                    amplitude *= 0.5;
+                    frequency *= 2;
+                }
+                registers[dst] = sum;
+                registers[dst + 1] = sum;
+                registers[dst + 2] = sum;
+                registers[dst + 3] = 1;
+                break;
+            }
+            case DECODE_OP.FLIPBOOK_INDEX: {
+                registers[dst] = flipbookFrame(t, a, b, true);
+                registers[dst + 1] = 0;
+                registers[dst + 2] = 0;
+                registers[dst + 3] = 1;
+                break;
+            }
+            case DECODE_OP.LATENT_LERP: {
+                const mix = t - Math.floor(t);
+                const src0 = a * 4;
+                const src1 = b * 4;
+                for (let c = 0; c < 4; c += 1) {
+                    registers[dst + c] =
+                        registers[src0 + c] * (1 - mix) + registers[src1 + c] * mix;
+                }
+                break;
+            }
+            case DECODE_OP.REMAP_CHANNEL: {
+                const src = a * 4;
+                for (let c = 0; c < 4; c += 1)
+                    registers[dst + c] = registers[src + c];
+                const semantic = REMAP_SEMANTICS[b >>> 4] ?? 'mask-linear';
+                const component = b & 0xf;
+                SAMPLE.set(registers.subarray(dst, dst + 4));
+                normaliseSample(SAMPLE, { semantic, component }, registers[src + component]);
+                registers.set(SAMPLE, dst);
+                break;
+            }
+            case DECODE_OP.COMPOSITE: {
+                const src0 = a * 4;
+                const src1 = b * 4;
+                const alpha = registers[src0 + 3];
+                for (let c = 0; c < 3; c += 1) {
+                    registers[dst + c] =
+                        registers[src0 + c] * alpha + registers[src1 + c] * (1 - alpha);
+                }
+                registers[dst + 3] = alpha + registers[src1 + 3] * (1 - alpha);
+                break;
+            }
+            case DECODE_OP.EVAL_NETWORK: {
+                const net = resources.networks[b];
+                if (net === undefined)
+                    break;
+                const src = a * 4;
+                for (let c = 0; c < net.shape.inputs; c += 1) {
+                    NET_IN[c] = c < 4 ? registers[src + c] : 0;
+                }
+                evalNetwork(net.shape, net.weights, NET_IN, NET_OUT, SCRATCH);
+                for (let c = 0; c < 4; c += 1) {
+                    registers[dst + c] = c < net.shape.outputs ? NET_OUT[c] : 0;
+                }
+                break;
+            }
+            default:
+                break;
+        }
+    }
+    const result = graph.result * 4;
+    for (let c = 0; c < 4; c += 1)
+        out[c] = registers[result + c];
+}
+/** A registers array of the right size, for a caller that holds one across calls. */
+export function createDecodeRegisters() {
+    return new Float32Array(MAX_REGISTERS * 4);
+}