@woosh/meep-engine 3.45.0 → 3.47.0

package/src/shade/renderer/buffer/GPUBufferAllocator.js

@@ -42,6 +42,15 @@ export class GPUBufferAllocator extends TransientResourcePool {
         return buffer_compare(a, b);
     }
 
+    /**
+     * The usage the buffer was made with, kept on its record beside the size the pool keeps: the order
+     * and the match read both, and a `GPUBuffer`'s are native reads.
+     * @param {import("../pool/TransientResourcePool.js").PoolRecord} record
+     */
+    describeRecord(record) {
+        record.usage = record.resource.usage;
+    }
+
     sizeOf(buffer) {
         return buffer.size;
     }

package/src/shade/renderer/buffer/buffer_pool_ops.d.ts

@@ -1,5 +1,5 @@
 /**
- * Total order over `{usage, size}`-bearing specs (a request descriptor or a live GPUBuffer).
+ * Total order over `{usage, size}`-bearing specs: a request descriptor, or a pool record.
  *
  * Sorted by size first (so the binary search lands on the smallest fitting buffer), then by usage
  * *bit-count* (so the narrowest-usage buffer is preferred — wide-usage buffers map to slower driver
@@ -16,29 +16,30 @@ export function compare_memory_spec(a: {
     usage: number;
     size: number;
 }): number;
+/**
+ * A pool record as {@link GPUBufferAllocator} keeps one: the buffer, and its `size` and `usage` as they
+ * were when it entered the pool. Ordering and matching read those, never the buffer, whose `size` and
+ * `usage` are native reads and are visited by the binary search and the scan many times a frame.
+ *
+ * @typedef {import("../pool/TransientResourcePool.js").PoolRecord & {usage: number}} BufferPoolRecord
+ */
 /**
  * Record ordering for the pool's sorted insert.
  *
- * @param {{resource:GPUBuffer}} a
- * @param {{resource:GPUBuffer}} b
+ * @param {BufferPoolRecord} a
+ * @param {BufferPoolRecord} b
  * @returns {number}
  */
-export function buffer_compare(a: {
-    resource: GPUBuffer;
-}, b: {
-    resource: GPUBuffer;
-}): number;
+export function buffer_compare(a: BufferPoolRecord, b: BufferPoolRecord): number;
 /**
  * Approximate first-fit: the smallest pooled buffer with `size >= request` and a usage *superset* of
  * the request, bounded against handing out a much-larger buffer.
  *
- * @param {{resource:GPUBuffer}[]} records sorted under {@link buffer_compare}
+ * @param {BufferPoolRecord[]} records sorted under {@link buffer_compare}
  * @param {{size:number, usage:number}} descriptor
  * @returns {number} index of a satisfying record, or -1
  */
-export function buffer_find(records: {
-    resource: GPUBuffer;
-}[], descriptor: {
+export function buffer_find(records: BufferPoolRecord[], descriptor: {
     size: number;
     usage: number;
 }): number;
@@ -63,4 +64,12 @@ export const ALLOW_LARGER_LIMIT_SCALE: number;
  * @type {number}
  */
 export const ALLOW_LARGER_LIMIT_FIXED: number;
+/**
+ * A pool record as {@link GPUBufferAllocator } keeps one: the buffer, and its `size` and `usage` as they
+ * were when it entered the pool. Ordering and matching read those, never the buffer, whose `size` and
+ * `usage` are native reads and are visited by the binary search and the scan many times a frame.
+ */
+export type BufferPoolRecord = import("../pool/TransientResourcePool.js").PoolRecord & {
+    usage: number;
+};
 //# sourceMappingURL=buffer_pool_ops.d.ts.map

package/src/shade/renderer/buffer/buffer_pool_ops.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"buffer_pool_ops.d.ts","sourceRoot":"","sources":["../../../../../src/shade/renderer/buffer/buffer_pool_ops.js"],"names":[],"mappings":"AAqBA;;;;;;;;;;GAUG;AACH,uCAJW;IAAC,KAAK,EAAC,MAAM,CAAC;IAAC,IAAI,EAAC,MAAM,CAAA;CAAC,KAC3B;IAAC,KAAK,EAAC,MAAM,CAAC;IAAC,IAAI,EAAC,MAAM,CAAA;CAAC,GACzB,MAAM,CAqBlB;AAED;;;;;;GAMG;AACH,kCAJW;IAAC,QAAQ,YAAU;CAAC,KACpB;IAAC,QAAQ,YAAU;CAAC,GAClB,MAAM,CAIlB;AAWD;;;;;;;GAOG;AACH,qCAJW;IAAC,QAAQ,YAAU;CAAC,EAAE,cACtB;IAAC,IAAI,EAAC,MAAM,CAAC;IAAC,KAAK,EAAC,MAAM,CAAA;CAAC,GACzB,MAAM,CAmClB;AAED;;;GAGG;AACH,mDAFa,MAAM,CAIlB;AAvHD;;;GAGG;AAEH;;;;GAIG;AACH,uCAFU,MAAM,CAE0B;AAC1C;;;;GAIG;AACH,uCAFU,MAAM,CAE6B"}
+{"version":3,"file":"buffer_pool_ops.d.ts","sourceRoot":"","sources":["../../../../../src/shade/renderer/buffer/buffer_pool_ops.js"],"names":[],"mappings":"AAqBA;;;;;;;;;;GAUG;AACH,uCAJW;IAAC,KAAK,EAAC,MAAM,CAAC;IAAC,IAAI,EAAC,MAAM,CAAA;CAAC,KAC3B;IAAC,KAAK,EAAC,MAAM,CAAC;IAAC,IAAI,EAAC,MAAM,CAAA;CAAC,GACzB,MAAM,CAqBlB;AAED;;;;;;GAMG;AAEH;;;;;;GAMG;AACH,kCAJW,gBAAgB,KAChB,gBAAgB,GACd,MAAM,CAIlB;AAED;;;;;;;GAOG;AACH,qCAJW,gBAAgB,EAAE,cAClB;IAAC,IAAI,EAAC,MAAM,CAAC;IAAC,KAAK,EAAC,MAAM,CAAA;CAAC,GACzB,MAAM,CAmClB;AAED;;;GAGG;AACH,mDAFa,MAAM,CAIlB;AAtHD;;;GAGG;AAEH;;;;GAIG;AACH,uCAFU,MAAM,CAE0B;AAC1C;;;;GAIG;AACH,uCAFU,MAAM,CAE6B;;;;;;+BAuChC,OAAO,kCAAkC,EAAE,UAAU,GAAG;IAAC,KAAK,EAAE,MAAM,CAAA;CAAC"}

package/src/shade/renderer/buffer/buffer_pool_ops.js

@@ -20,7 +20,7 @@ export const ALLOW_LARGER_LIMIT_SCALE = 2;
 export const ALLOW_LARGER_LIMIT_FIXED = 1024;
 
 /**
- * Total order over `{usage, size}`-bearing specs (a request descriptor or a live GPUBuffer).
+ * Total order over `{usage, size}`-bearing specs: a request descriptor, or a pool record.
  *
  * Sorted by size first (so the binary search lands on the smallest fitting buffer), then by usage
  * *bit-count* (so the narrowest-usage buffer is preferred — wide-usage buffers map to slower driver
@@ -52,37 +52,36 @@ export function compare_memory_spec(a, b) {
 }
 
 /**
- * Record ordering for the pool's sorted insert.
+ * A pool record as {@link GPUBufferAllocator} keeps one: the buffer, and its `size` and `usage` as they
+ * were when it entered the pool. Ordering and matching read those, never the buffer, whose `size` and
+ * `usage` are native reads and are visited by the binary search and the scan many times a frame.
  *
- * @param {{resource:GPUBuffer}} a
- * @param {{resource:GPUBuffer}} b
- * @returns {number}
+ * @typedef {import("../pool/TransientResourcePool.js").PoolRecord & {usage: number}} BufferPoolRecord
  */
-export function buffer_compare(a, b) {
-    return compare_memory_spec(a.resource, b.resource);
-}
 
 /**
- * @param {{resource:GPUBuffer}} record
- * @param {{size:number}} descriptor
+ * Record ordering for the pool's sorted insert.
+ *
+ * @param {BufferPoolRecord} a
+ * @param {BufferPoolRecord} b
  * @returns {number}
  */
-function compare_descriptor_to_record(descriptor, record) {
-    return compare_memory_spec(descriptor, record.resource);
+export function buffer_compare(a, b) {
+    return compare_memory_spec(a, b);
 }
 
 /**
  * Approximate first-fit: the smallest pooled buffer with `size >= request` and a usage *superset* of
  * the request, bounded against handing out a much-larger buffer.
  *
- * @param {{resource:GPUBuffer}[]} records sorted under {@link buffer_compare}
+ * @param {BufferPoolRecord[]} records sorted under {@link buffer_compare}
  * @param {{size:number, usage:number}} descriptor
  * @returns {number} index of a satisfying record, or -1
  */
 export function buffer_find(records, descriptor) {
     const count = records.length;
 
-    let index = binarySearchHighIndex(records, descriptor, compare_descriptor_to_record);
+    let index = binarySearchHighIndex(records, descriptor, compare_memory_spec);
 
     if (index >= count) {
         return -1;
@@ -93,19 +92,19 @@ export function buffer_find(records, descriptor) {
     }
 
     for (; index < count; index++) {
-        const buffer = records[index].resource;
+        const record = records[index];
 
         if (
-            buffer.size > descriptor.size * ALLOW_LARGER_LIMIT_SCALE
-            && (buffer.size - descriptor.size) > ALLOW_LARGER_LIMIT_FIXED
+            record.size > descriptor.size * ALLOW_LARGER_LIMIT_SCALE
+            && (record.size - descriptor.size) > ALLOW_LARGER_LIMIT_FIXED
         ) {
             // records are sorted by size: everything from here on is too large
             break;
         }
 
         if (
-            (buffer.usage & descriptor.usage) === descriptor.usage
-            && buffer.size >= descriptor.size
+            (record.usage & descriptor.usage) === descriptor.usage
+            && record.size >= descriptor.size
         ) {
             return index;
         }

package/src/shade/renderer/camera/Camera.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../core/assert.js";
-import { combine_hash } from "../../../core/collection/array/combine_hash.js";
+import { hash_mix3 } from "../../../core/math/hash/hash_mix3.js";
 import { m4_allocate } from "../../../core/geom/3d/mat4/m4_allocate.js";
 import { m4_multiply } from "../../../core/geom/3d/mat4/m4_multiply.js";
 import { plane3_normalize } from "../../../core/geom/3d/plane/plane3_normalize.js";
@@ -189,7 +189,7 @@ export class Camera {
     }
 
     hash() {
-        return combine_hash(
+        return hash_mix3(
             computeHashFloat(this.#near),
             computeHashFloat(this.#far),
             computeHashFloat(this.#aspect),

package/src/shade/renderer/geometry/Attribute.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../core/assert.js";
-import { combine_hash } from "../../../core/collection/array/combine_hash.js";
+import { hash_mix3 } from "../../../core/math/hash/hash_mix3.js";
 import {
     compute_binary_data_type_from_typed_array
 } from "../../../core/collection/array/typed/compute_binary_data_type_from_typed_array.js";
@@ -89,7 +89,7 @@ export class Attribute {
     }
 
     hash() {
-        return combine_hash(
+        return hash_mix3(
             this.spec.hash(),
             this.count,
             sparse_typed_array_hash(this.data, 0, this.data.length)

package/src/shade/renderer/geometry/Geometry.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../core/assert.js";
-import { combine_hash } from "../../../core/collection/array/combine_hash.js";
+import { hash_mix3 } from "../../../core/math/hash/hash_mix3.js";
 import { computeHashArray } from "../../../core/collection/array/computeHashArray.js";
 import { isArrayEqual } from "../../../core/collection/array/isArrayEqual.js";
 import { aabb3_from_v3_array } from "../../../core/geom/3d/aabb/aabb3_from_v3_array.js";
@@ -178,7 +178,7 @@ export class Geometry {
 
     hash() {
 
-        return combine_hash(
+        return hash_mix3(
             computeStringHash(this.name),
             optional_hash(this.index),
             computeHashArray(this.attributes, invokeObjectHash)

package/src/shade/renderer/geometry/geometry_deduplicate_vertices.js

@@ -1,5 +1,5 @@
 import { reinterpret_float32_as_int32 } from "../../../core/binary/reinterpret_float32_as_int32.js";
-import { combine_hash } from "../../../core/collection/array/combine_hash.js";
+import { hash_mix2 } from "../../../core/math/hash/hash_mix2.js";
 import { Attribute } from "./Attribute.js";
 import { Geometry } from "./Geometry.js";
 import { StandardAttributes } from "./StandardAttributes.js";
@@ -125,7 +125,7 @@ function vertex_hash(datas, strides, num_attrs, vertex_index) {
             // canonicalize -0 to +0: they compare `===` in vertices_equal but have
             // different bit patterns, which would scatter equal vertices across buckets
             const value = data[base + s];
-            h = combine_hash(h, reinterpret_float32_as_int32(value === 0 ? 0 : value));
+            h = hash_mix2(h, reinterpret_float32_as_int32(value === 0 ? 0 : value));
         }
     }
     return h | 0;

package/src/shade/renderer/geometry/meshlet/MeshletBatch.js

@@ -2,7 +2,7 @@ import { assert } from "../../../../core/assert.js";
 import { BinaryBuffer } from "../../../../core/binary/BinaryBuffer.js";
 import { platform_compute_endianness } from "../../../../core/binary/platform_compute_endianness.js";
 import { BinaryDataType } from "../../../../core/binary/type/BinaryDataType.js";
-import { combine_hash } from "../../../../core/collection/array/combine_hash.js";
+import { hash_mix2 } from "../../../../core/math/hash/hash_mix2.js";
 import { array_buffer_hash } from "../../../../core/collection/array/typed/array_buffer_hash.js";
 import { is_array_buffer_equals } from "../../../../core/collection/array/typed/is_array_buffer_equals.js";
 import { RowFirstTable } from "../../../../core/collection/table/RowFirstTable.js";
@@ -119,7 +119,7 @@ export class MeshletBatch {
     hash() {
         const meta = this.#metadata;
 
-        return combine_hash(
+        return hash_mix2(
             this.#count,
             array_buffer_hash(meta, 0, meta.byteLength)
         );

package/src/shade/renderer/geometry/virtual/format/checksum/vgeo_compute_asset_id.js

@@ -1,13 +1,13 @@
-import { xxh3_128 } from "../../../../../../core/binary/hash/xxh3_128.js";
-import { vgeo_asset_id_preimage } from "./vgeo_asset_id_preimage.js";
-
-/**
- * @param {BinaryBuffer} buffer whole file
- * @returns {XXH128Hash} the asset's identity
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export function vgeo_compute_asset_id(buffer) {
-    return xxh3_128(vgeo_asset_id_preimage(buffer).raw_bytes);
-}
+import { xxh3_128 } from "../../../../../../core/math/hash/xxh3_128.js";
+import { vgeo_asset_id_preimage } from "./vgeo_asset_id_preimage.js";
+
+/**
+ * @param {BinaryBuffer} buffer whole file
+ * @returns {XXH128Hash} the asset's identity
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function vgeo_compute_asset_id(buffer) {
+    return xxh3_128(vgeo_asset_id_preimage(buffer).raw_bytes);
+}

package/src/shade/renderer/geometry/virtual/format/checksum/vgeo_compute_directory_block_checksum.js

@@ -1,41 +1,41 @@
-import { xxh3_64 } from "../../../../../../core/binary/hash/xxh3_64.js";
-import { VGEO_DIRECTORY_BLOCK_RECORDS } from "../directory/VGEO_DIRECTORY_BLOCK_RECORDS.js";
-import { VGEO_DIRECTORY_RECORD_SIZE } from "../directory/VGEO_DIRECTORY_RECORD_SIZE.js";
-
-/**
- * The checksum of one 4 KB directory block. The final block is short whenever the record count is
- * not a multiple of {@link VGEO_DIRECTORY_BLOCK_RECORDS}, and covers only the records that exist.
- *
- * The seed is taken from `asset_id`, which is why {@link vgeo_asset_id_preimage} zeroes this region
- * before hashing: the two would otherwise be defined in terms of each other.
- *
- * @param {BinaryBuffer} buffer whole file
- * @param {number} directory_offset
- * @param {number} total_pages
- * @param {number} block_index
- * @param {bigint} asset_id_high64
- * @returns {bigint}
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export function vgeo_compute_directory_block_checksum(
-    buffer,
-    directory_offset,
-    total_pages,
-    block_index,
-    asset_id_high64
-) {
-    const first_record = block_index * VGEO_DIRECTORY_BLOCK_RECORDS;
-
-    const record_count = Math.min(VGEO_DIRECTORY_BLOCK_RECORDS, total_pages - first_record);
-
-    const start = directory_offset + first_record * VGEO_DIRECTORY_RECORD_SIZE;
-
-    const seed = asset_id_high64 ^ BigInt(block_index);
-
-    return xxh3_64(
-        buffer.raw_bytes.subarray(start, start + record_count * VGEO_DIRECTORY_RECORD_SIZE),
-        seed
-    );
-}
+import { xxh3_64 } from "../../../../../../core/math/hash/xxh3_64.js";
+import { VGEO_DIRECTORY_BLOCK_RECORDS } from "../directory/VGEO_DIRECTORY_BLOCK_RECORDS.js";
+import { VGEO_DIRECTORY_RECORD_SIZE } from "../directory/VGEO_DIRECTORY_RECORD_SIZE.js";
+
+/**
+ * The checksum of one 4 KB directory block. The final block is short whenever the record count is
+ * not a multiple of {@link VGEO_DIRECTORY_BLOCK_RECORDS}, and covers only the records that exist.
+ *
+ * The seed is taken from `asset_id`, which is why {@link vgeo_asset_id_preimage} zeroes this region
+ * before hashing: the two would otherwise be defined in terms of each other.
+ *
+ * @param {BinaryBuffer} buffer whole file
+ * @param {number} directory_offset
+ * @param {number} total_pages
+ * @param {number} block_index
+ * @param {bigint} asset_id_high64
+ * @returns {bigint}
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function vgeo_compute_directory_block_checksum(
+    buffer,
+    directory_offset,
+    total_pages,
+    block_index,
+    asset_id_high64
+) {
+    const first_record = block_index * VGEO_DIRECTORY_BLOCK_RECORDS;
+
+    const record_count = Math.min(VGEO_DIRECTORY_BLOCK_RECORDS, total_pages - first_record);
+
+    const start = directory_offset + first_record * VGEO_DIRECTORY_RECORD_SIZE;
+
+    const seed = asset_id_high64 ^ BigInt(block_index);
+
+    return xxh3_64(
+        buffer.raw_bytes.subarray(start, start + record_count * VGEO_DIRECTORY_RECORD_SIZE),
+        seed
+    );
+}

package/src/shade/renderer/geometry/virtual/format/checksum/vgeo_compute_frame_checksum.js

@@ -1,41 +1,41 @@
-import { xxh3_64 } from "../../../../../../core/binary/hash/xxh3_64.js";
-import { VGEO_FRAME_HEADER_SIZE } from "../frame/VGEO_FRAME_HEADER_SIZE.js";
-import { VGEO_FRAME_OFFSET } from "../frame/VGEO_FRAME_OFFSET.js";
-
-/**
- * The identity-seeded checksum of one frame: xxh3-64 over the frame's bytes with its own `checksum`
- * field cut out, seeded so that a well-formed frame of the wrong page or the wrong asset fails to
- * verify rather than installing silently.
- *
- * The seed is taken from `asset_id`, which is why {@link vgeo_asset_id_preimage} zeroes this field
- * before hashing: the two would otherwise be defined in terms of each other.
- *
- * @param {BinaryBuffer} buffer whole file
- * @param {VGeoFrameExtent} frame
- * @param {bigint} asset_id_low64
- * @returns {bigint}
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export function vgeo_compute_frame_checksum(buffer, frame, asset_id_low64) {
-    const seed = asset_id_low64 ^ BigInt(frame.page_index);
-
-    const bytes = buffer.raw_bytes;
-
-    const covered = new Uint8Array(frame.extent - 8);
-
-    // frame bytes [0, 16)
-    covered.set(
-        bytes.subarray(frame.frame_offset, frame.frame_offset + VGEO_FRAME_OFFSET.CHECKSUM),
-        0
-    );
-
-    // frame bytes [24, extent)
-    covered.set(
-        bytes.subarray(frame.frame_offset + VGEO_FRAME_HEADER_SIZE, frame.frame_offset + frame.extent),
-        VGEO_FRAME_OFFSET.CHECKSUM
-    );
-
-    return xxh3_64(covered, seed);
-}
+import { xxh3_64 } from "../../../../../../core/math/hash/xxh3_64.js";
+import { VGEO_FRAME_HEADER_SIZE } from "../frame/VGEO_FRAME_HEADER_SIZE.js";
+import { VGEO_FRAME_OFFSET } from "../frame/VGEO_FRAME_OFFSET.js";
+
+/**
+ * The identity-seeded checksum of one frame: xxh3-64 over the frame's bytes with its own `checksum`
+ * field cut out, seeded so that a well-formed frame of the wrong page or the wrong asset fails to
+ * verify rather than installing silently.
+ *
+ * The seed is taken from `asset_id`, which is why {@link vgeo_asset_id_preimage} zeroes this field
+ * before hashing: the two would otherwise be defined in terms of each other.
+ *
+ * @param {BinaryBuffer} buffer whole file
+ * @param {VGeoFrameExtent} frame
+ * @param {bigint} asset_id_low64
+ * @returns {bigint}
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function vgeo_compute_frame_checksum(buffer, frame, asset_id_low64) {
+    const seed = asset_id_low64 ^ BigInt(frame.page_index);
+
+    const bytes = buffer.raw_bytes;
+
+    const covered = new Uint8Array(frame.extent - 8);
+
+    // frame bytes [0, 16)
+    covered.set(
+        bytes.subarray(frame.frame_offset, frame.frame_offset + VGEO_FRAME_OFFSET.CHECKSUM),
+        0
+    );
+
+    // frame bytes [24, extent)
+    covered.set(
+        bytes.subarray(frame.frame_offset + VGEO_FRAME_HEADER_SIZE, frame.frame_offset + frame.extent),
+        VGEO_FRAME_OFFSET.CHECKSUM
+    );
+
+    return xxh3_64(covered, seed);
+}

package/src/shade/renderer/geometry/virtual/format/checksum/vgeo_compute_header_checksum.js

@@ -1,25 +1,25 @@
-import { BinaryBuffer } from "../../../../../../core/binary/BinaryBuffer.js";
-import { xxh3_64 } from "../../../../../../core/binary/hash/xxh3_64.js";
-import { VGEO_HEADER_OFFSET } from "../header/VGEO_HEADER_OFFSET.js";
-import { VGEO_HEADER_SIZE } from "../header/VGEO_HEADER_SIZE.js";
-
-/**
- * xxh3-64 of the header with `header_checksum` zeroed. `asset_id` must already be final: the
- * ordering is what keeps the two non-circular.
- *
- * @param {BinaryBuffer} buffer whole file
- * @returns {bigint}
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export function vgeo_compute_header_checksum(buffer) {
-    const header = new BinaryBuffer();
-
-    header.fromArrayBuffer(buffer.raw_bytes.slice(0, VGEO_HEADER_SIZE).buffer);
-
-    header.position = VGEO_HEADER_OFFSET.HEADER_CHECKSUM;
-    header.writeUint64(0n);
-
-    return xxh3_64(header.raw_bytes);
-}
+import { BinaryBuffer } from "../../../../../../core/binary/BinaryBuffer.js";
+import { xxh3_64 } from "../../../../../../core/math/hash/xxh3_64.js";
+import { VGEO_HEADER_OFFSET } from "../header/VGEO_HEADER_OFFSET.js";
+import { VGEO_HEADER_SIZE } from "../header/VGEO_HEADER_SIZE.js";
+
+/**
+ * xxh3-64 of the header with `header_checksum` zeroed. `asset_id` must already be final: the
+ * ordering is what keeps the two non-circular.
+ *
+ * @param {BinaryBuffer} buffer whole file
+ * @returns {bigint}
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function vgeo_compute_header_checksum(buffer) {
+    const header = new BinaryBuffer();
+
+    header.fromArrayBuffer(buffer.raw_bytes.slice(0, VGEO_HEADER_SIZE).buffer);
+
+    header.position = VGEO_HEADER_OFFSET.HEADER_CHECKSUM;
+    header.writeUint64(0n);
+
+    return xxh3_64(header.raw_bytes);
+}

package/src/shade/renderer/gpu_primitive/test/gpu_test.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"gpu_test.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/gpu_primitive/test/gpu_test.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,sCAJW,MAAM,cAEL,QAAQ,IAAI,CAAC,CA+DxB"}
+{"version":3,"file":"gpu_test.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/gpu_primitive/test/gpu_test.js"],"names":[],"mappings":"AAMA;;;;;GAKG;AACH,sCAJW,MAAM,cAEL,QAAQ,IAAI,CAAC,CAyDxB"}

package/src/shade/renderer/gpu_primitive/test/gpu_test.js

@@ -1,4 +1,7 @@
 import { WebGPUExtensionType } from "../../../descriptor/WebGPUExtensionType.js";
+import { SHADE_DEVICE_FLOOR } from "../../../device/SHADE_DEVICE_FLOOR.js";
+import { shade_device_floor_unmet } from "../../../device/shade_device_floor_unmet.js";
+import { ShadeDeviceFailure } from "../../../device/ShadeDeviceFailure.js";
 import { GraphicsContext } from "../../GraphicsContext.js";
 
 /**
@@ -36,32 +39,26 @@ export async function gpu_test(description, body) {
     //
     // console.warn('adapter limits:', adapter.limits);
 
-    const maxStorageBuffersPerShaderStage = adapter.limits.maxStorageBuffersPerShaderStage;
+    const unmet = shade_device_floor_unmet(adapter);
 
-    if (maxStorageBuffersPerShaderStage < 10) {
-        throw new Error(`Engine requires at least 10 storage buffers per shader stage, actual is ${maxStorageBuffersPerShaderStage}`);
+    if (unmet.length > 0) {
+        throw ShadeDeviceFailure.below_floor(unmet);
     }
 
     const device = await adapter.requestDevice({
         requiredLimits: {
-            // required for large G-buffers
-            maxColorAttachmentBytesPerSample: 32,
+            ...SHADE_DEVICE_FLOOR.limits,
 
             /*
              grab the largest buffer limit we can get, default limits are super-low
              */
             maxBufferSize: adapter.limits.maxBufferSize,
             maxStorageBufferBindingSize: adapter.limits.maxStorageBufferBindingSize,
-
-            maxStorageBuffersPerShaderStage: 10,
         },
         requiredFeatures: [
+            ...SHADE_DEVICE_FLOOR.features,
             // required for timers
             WebGPUExtensionType.TimestampQuery,
-            // required for indirect draw that's used extensively in Shade
-            WebGPUExtensionType.IndirectFirstInstance,
-            // required for OIT
-            WebGPUExtensionType.Float32Blendable,
         ]
     });
 

package/src/shade/renderer/loader/gltf/tiny-gltf.d.ts

@@ -13,7 +13,7 @@ export class TinyGltf {
      * @readonly
      * @type {TextureFormat}
      */
-    static readonly "__#265@#UNCOMPRESSED_TARGET": TextureFormat;
+    static readonly "__#267@#UNCOMPRESSED_TARGET": TextureFormat;
     /**
      * @param {AssetManager} assetManager
      * @param {AssetRequestScope} [scope]

package/src/shade/renderer/material/StandardShadeMaterial.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StandardShadeMaterial.d.ts","sourceRoot":"","sources":["../../../../../src/shade/renderer/material/StandardShadeMaterial.js"],"names":[],"mappings":"AAOA;;;;GAIG;AAEH;IACI;;;OAGG;IACH,gBAFU,YAAY,CAEP;IAEf;;;OAGG;IACH,eAFU,KAAK,CAEsB;IAErC;;OAEG;IACH,gBAFU,YAAY,CAEP;IAEf;;;;;;OAMG;IACH,aAFU,YAAY,CAEV;IAEZ;;OAEG;IACH,kBAFU,YAAY,CAEL;IAEjB;;;;;;;;OAQG;IACH,UAFU,mBAAmB,GAAC,SAAS,CAE9B;IAET;;;OAGG;IACH,kBAFU,MAAM,CAEK;IAErB;;;OAGG;IACH,iBAFU,MAAM,CAEI;IAEpB;;;;;;;;OAQG;IACH,qBAFU,MAAM,CAEQ;IAExB;;;;;;OAMG;IACH,YAFU,MAAM,CAEC;IAEjB;;;;;;;;;;;OAWG;IACH,QAFU,mBAAmB,GAAC,IAAI,CAEpB;IAEd;;;OAGG;IACH,iBAFU,KAAK,CAE4B;IAE3C;;;OAGG;IACH,iBAFU,cAAc,CAEmB;IAW3C;;;;;OAKG;IACH,YAFW,qBAAqB,QAoB/B;IAED;;;OAGG;IACH,SAFa,qBAAqB,CAQjC;IAaD;;;;OAIG;IACH,cAHW,qBAAqB,GACnB,OAAO,CA+BnB;IAGL;;;OAGG;IACH,kCAFU,OAAO,CAEsC;CANtD;2BAvMY,OAAO,4BAA4B,EAAE,YAAY;kCACjD,OAAO,2CAA2C,EAAE,mBAAmB;kCACvE,OAAO,kCAAkC,EAAE,mBAAmB;8BAL7C,oBAAoB;sBAJ5B,8BAA8B;2BACzB,4CAA4C"}
+{"version":3,"file":"StandardShadeMaterial.d.ts","sourceRoot":"","sources":["../../../../../src/shade/renderer/material/StandardShadeMaterial.js"],"names":[],"mappings":"AAQA;;;;GAIG;AAEH;IACI;;;OAGG;IACH,gBAFU,YAAY,CAEP;IAEf;;;OAGG;IACH,eAFU,KAAK,CAEsB;IAErC;;OAEG;IACH,gBAFU,YAAY,CAEP;IAEf;;;;;;OAMG;IACH,aAFU,YAAY,CAEV;IAEZ;;OAEG;IACH,kBAFU,YAAY,CAEL;IAEjB;;;;;;;;OAQG;IACH,UAFU,mBAAmB,GAAC,SAAS,CAE9B;IAET;;;OAGG;IACH,kBAFU,MAAM,CAEK;IAErB;;;OAGG;IACH,iBAFU,MAAM,CAEI;IAEpB;;;;;;;;OAQG;IACH,qBAFU,MAAM,CAEQ;IAExB;;;;;;OAMG;IACH,YAFU,MAAM,CAEC;IAEjB;;;;;;;;;;;OAWG;IACH,QAFU,mBAAmB,GAAC,IAAI,CAEpB;IAEd;;;OAGG;IACH,iBAFU,KAAK,CAE4B;IAE3C;;;OAGG;IACH,iBAFU,cAAc,CAEmB;IAW3C;;;;;OAKG;IACH,YAFW,qBAAqB,QAoB/B;IAED;;;OAGG;IACH,SAFa,qBAAqB,CAQjC;IAiBD;;;;OAIG;IACH,cAHW,qBAAqB,GACnB,OAAO,CA+BnB;IAGL;;;OAGG;IACH,kCAFU,OAAO,CAEsC;CANtD;2BA3MY,OAAO,4BAA4B,EAAE,YAAY;kCACjD,OAAO,2CAA2C,EAAE,mBAAmB;kCACvE,OAAO,kCAAkC,EAAE,mBAAmB;8BAL7C,oBAAoB;sBAJ5B,8BAA8B;2BACzB,4CAA4C"}

package/src/shade/renderer/material/StandardShadeMaterial.js

@@ -1,4 +1,5 @@
-import { combine_hash } from "../../../core/collection/array/combine_hash.js";
+import { hash_mix2 } from "../../../core/math/hash/hash_mix2.js";
+import { hash_mix3 } from "../../../core/math/hash/hash_mix3.js";
 import { Color } from "../../../core/color/Color.js";
 import LinearModifier from "../../../core/model/stat/LinearModifier.js";
 import { optional_equality } from "../../../core/model/object/optional_equality.js";
@@ -160,13 +161,17 @@ export class StandardShadeMaterial extends ShadeMaterial {
     }
 
     hash() {
-        return combine_hash(
-            super.hash(),
-            this.diffuse_color.hash(),
-            optional_hash(this.texture_albedo),
-            optional_hash(this.texture_normal),
-            optional_hash(this.texture_orm),
-            optional_hash(this.texture_emissive),
+        return hash_mix2(
+            hash_mix3(
+                hash_mix3(
+                    super.hash(),
+                    this.diffuse_color.hash(),
+                    optional_hash(this.texture_albedo)
+                ),
+                optional_hash(this.texture_normal),
+                optional_hash(this.texture_orm)
+            ),
+            optional_hash(this.texture_emissive)
         );
     }