@aardworx/wombat.rendering 0.9.33 → 0.19.0

package/dist/runtime/heapScene/pools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pools.d.ts","sourceRoot":"","sources":["../../../src/runtime/heapScene/pools.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACnE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAW,MAAM,iBAAiB,CAAC;AAItD;;iCAEiC;AACjC,eAAO,MAAM,kBAAkB,IAAM,CAAC;AACtC,eAAO,MAAM,mBAAmB,KAAM,CAAC;AAEvC,iDAAiD;AACjD,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B;yCACyC;AACzC,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,eAAO,MAAM,WAAW,IAAM,CAAC;AAI/B,UAAU,SAAS;IACjB,4EAA4E;IAC5E,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,4DAA4D;IAC5D,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IACtE,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;GAYG;AACH,qBAAa,WAAW;IAKtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuC;IAE9D,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO;IAC/B,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,SAAS,GAAG,SAAS;IAE/C;;;;;;OAMG;IACH,OAAO,CACL,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,cAAc,EACrB,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EACjB,KAAK,EAAE,OAAO,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,GAC3D,MAAM;IAuBT,8DAA8D;IAC9D,OAAO,CAAC,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI;IASvD,mEAAmE;IACnE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,GAAG,IAAI;CAWxF;AAID;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAGnB;IACJ,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAqC;IAChE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA0C;IACpE,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,UAAU;IASlB,OAAO,CACL,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,cAAc,EACvB,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EACrB,GAAG,EAAE,WAAW,GACf;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE;IA6BxC,OAAO,CAAC,OAAO,EAAE,cAAc,EAAE,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI;CAY9D;AAWD;;;;;GAKG;AACH,qBAAa,QAAQ;IAGP,OAAO,CAAC,QAAQ,CAAC,GAAG;IAAc,OAAO,CAAC,QAAQ,CAAC,SAAS;IAFxE,OAAO,CAAC,IAAI,CAAgB;IAC5B,OAAO,CAAC,QAAQ,CAAK;gBACQ,GAAG,EAAE,UAAU,EAAmB,SAAS,EAAE,MAAM;IAChF,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,yEAAyE;IACzE,IAAI,YAAY,IAAI,MAAM,CAA2B;IACrD,2EAA2E;IAC3E,IAAI,SAAS,IAAI,MAAM,CAA2C;IAClE,KAAK,IAAI,MAAM;IAMf,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAID;;;;;GAKG;AACH,qBAAa,cAAc;IAQb,OAAO,CAAC,QAAQ,CAAC,GAAG;IAPhC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAuC;IACvD;oEACgE;IAChE,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAY;IAC5B,OAAO,CAAC,QAAQ,CAAK;gBACQ,GAAG,EAAE,UAAU;IAQ5C,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,IAAI,QAAQ,IAAI,MAAM,CAA8B;IACpD,IAAI,SAAS,IAAI,MAAM,CAAwB;IAC/C,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI;IAM1C,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAU9B;;;OAGG;IACH,KAAK,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAkBhC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAI7C,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EAAE,EACzC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,GACX,IAAI,CAwBN;AAID;;;;GAIG;AACH,qBAAa,cAAc;IAMb,OAAO,CAAC,QAAQ,CAAC,GAAG;IALhC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAuC;IACvD,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAY;IAC5B,OAAO,CAAC,QAAQ,CAAK;gBACQ,GAAG,EAAE,UAAU;IAQ5C,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,IAAI,YAAY,IAAI,MAAM,CAAwB;IAClD,KAAK,CAAC,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI;IAMpD,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAU9B,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAgB/B,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAG5C,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAID;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAK,cAAc,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAG,cAAc,CAAC;CACnC;AAED,wBAAgB,eAAe,CAC7B,MAAM,EAAE,SAAS,EACjB,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,EACb,aAAa,GAAE,mBAAuB,GACrC,UAAU,CAUZ;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAEpD;AAED,wGAAwG;AACxG,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GACjG,IAAI,CASN;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAIjD;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,UAAU,CAMxD;AAED;iEACiE;AACjE,wBAAgB,SAAS,CAAC,IAAI,EAAE,gBAAgB,GAAG,YAAY,CAM9D"}
+{"version":3,"file":"pools.d.ts","sourceRoot":"","sources":["../../../src/runtime/heapScene/pools.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACnE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAqC,MAAM,iBAAiB,CAAC;AAEhF,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAIjF;;iCAEiC;AACjC,eAAO,MAAM,kBAAkB,IAAM,CAAC;AACtC,eAAO,MAAM,mBAAmB,KAAM,CAAC;AAEvC,iDAAiD;AACjD,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B;yCACyC;AACzC,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,eAAO,MAAM,WAAW,IAAM,CAAC;AAI/B;;;;;GAKG;AACH,UAAU,SAAS;IACjB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IACtE,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoD;IAE3E,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAGjD;;oEAEgE;IAChE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO;IAGlC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAGjE;;0DAEsD;IACtD,oBAAoB,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,MAAM,GAAG,SAAS;IAM3D;;;;;OAKG;IACH,OAAO,CACL,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,qBAAqB,EAC5B,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,OAAO,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,GAC3D,MAAM;IA8CT,OAAO,CAAC,KAAK,EAAE,qBAAqB,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAqBhF;;;4DAGwD;IACxD,MAAM,CACJ,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,qBAAqB,EAC5B,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EACjB,GAAG,EAAE,OAAO,GACX,IAAI;IAiBP;uDACmD;IACnD,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,MAAM;CAO1C;AAID;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;6DACyD;IACzD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAGnB;IACJ,0DAA0D;IAC1D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAqC;IAChE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA0C;IACpE,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,UAAU;IASlB,oBAAoB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,GAAG,SAAS;IAM/D,OAAO,CACL,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,qBAAqB,EAC9B,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,WAAW,GACf;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE;IA6C1D,OAAO,CAAC,OAAO,EAAE,qBAAqB,EAAE,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;CAgBvF;AAYD;;;;;GAKG;AACH,qBAAa,QAAQ;IAKP,OAAO,CAAC,QAAQ,CAAC,GAAG;IAAc,OAAO,CAAC,QAAQ,CAAC,SAAS;IAJxE,OAAO,CAAC,IAAI,CAAgB;IAC5B,OAAO,CAAC,QAAQ,CAAK;IACrB,gEAAgE;IAChE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAqB;gBACb,GAAG,EAAE,UAAU,EAAmB,SAAS,EAAE,MAAM;IAChF,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,yEAAyE;IACzE,IAAI,YAAY,IAAI,MAAM,CAA2B;IACrD,2EAA2E;IAC3E,IAAI,SAAS,IAAI,MAAM,CAA2C;IAClE,KAAK,IAAI,MAAM;IAUf,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAO3B,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAID;;;;;GAKG;AACH,qBAAa,cAAc;IAab,OAAO,CAAC,QAAQ,CAAC,GAAG;IAZhC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAkB;IAC3C;;;gEAG4D;IAC5D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD;oEACgE;IAChE,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAY;IAC5B,OAAO,CAAC,QAAQ,CAAK;gBACQ,GAAG,EAAE,UAAU;IAQ5C,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,IAAI,QAAQ,IAAI,MAAM,CAA8B;IACpD,IAAI,SAAS,IAAI,MAAM,CAAwB;IAC/C;;;;;qCAKiC;IACjC,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW;IAGtD,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI;IAM1C,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAU9B;;;OAGG;IACH;;;0BAGsB;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAgB/C,KAAK,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAShC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IA8B7C,sEAAsE;IACtE,OAAO,CAAC,WAAW;IAgBnB,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAID;;;;GAIG;AACH,qBAAa,cAAc;IAQb,OAAO,CAAC,QAAQ,CAAC,GAAG;IAPhC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAkB;IAC3C,8DAA8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAY;IAC5B,OAAO,CAAC,QAAQ,CAAK;gBACQ,GAAG,EAAE,UAAU;IAQ5C,IAAI,MAAM,IAAI,SAAS,CAA4B;IACnD,IAAI,YAAY,IAAI,MAAM,CAAwB;IAClD,KAAK,CAAC,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI;IAMpD,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAU9B;;oEAEgE;IAChE,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAe9C,OAAO,CAAC,WAAW;IAYnB,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAO/B,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAwB5C,QAAQ,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,WAAW;IACrC,OAAO,IAAI,IAAI;CAChB;AAID;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAK,qBAAqB,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAG,qBAAqB,CAAC;CAC1C;AAED,wBAAgB,eAAe,CAC7B,MAAM,EAAE,SAAS,EACjB,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,EACb,aAAa,GAAE,mBAAuB,EACtC,aAAa,GAAE,MAAM,GAAG,SAAqB,GAC5C,UAAU,CAkBZ;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAEpD;AAED,wGAAwG;AACxG,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GACjG,IAAI,CASN;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAIjD;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,UAAU,CAMxD;AAED;iEACiE;AACjE,wBAAgB,SAAS,CAAC,IAAI,EAAE,gBAAgB,GAAG,YAAY,CAM9D"}

package/dist/runtime/heapScene/pools.js

@@ -15,7 +15,9 @@
 // / `isBufferView` / `asFloat32` helpers that the heap-scene factory
 // uses to assemble the arena.
 import { AVal } from "@aardworx/wombat.adaptive";
-import { GrowBuffer, ALIGN16 } from "./growBuffer.js";
+import { GrowBuffer, ALIGN16, DEFAULT_MAX_BUFFER_BYTES } from "./growBuffer.js";
+import { Freelist } from "./freelist.js";
+import { ChunkedAttributeArena, ChunkedIndexAllocator } from "./chunkedArena.js";
 // ─── Per-allocation header layout ──────────────────────────────────────
 /** Per-allocation header: (u32 typeId, u32 length). Data follows
  *  the header aligned up to 16 bytes (so positions/normals/etc. line
@@ -29,76 +31,137 @@ export const ENC_V3F_TIGHT = 1; // tightly-packed array of vec3<f32> (12 B/elt)
 export const SEM_POSITIONS = 1;
 export const SEM_NORMALS = 2;
 /**
- * Aval-keyed pool of arena allocations. One allocation per unique
- * aval (object identity). Two draws referencing the same aval share
- * the allocation; their DrawHeaders carry the same u32 ref. Holds
- * uniforms (fixed-size scalars/vectors/matrices) AND attribute arrays
- * (variable-size). The caller decides `dataBytes` + `length` per
- * acquisition — the pool just keys on aval identity and refcounts.
- *
- * Sharing emerges from aval identity — no separate "frequency"
- * declaration needed. A `cval` shared by all draws → 1 alloc.
- * A static positions array shared across instanced draws → 1 alloc.
- * Same code path either way.
+ * `(aval, chunkIdx)`-keyed pool of chunked-arena allocations. An
+ * aval that's referenced from multiple chunks (e.g. two ROs sharing
+ * a uniform but landing in different chunks) gets one entry per
+ * chunk — accepted duplication cost of the multi-draw-call
+ * per-chunk render path (§3). Within a single chunk, ROs sharing
+ * an aval still share the underlying allocation.
  */
 export class UniformPool {
-    // Keyed by `aval<unknown>` *by reference* (a plain JS `Map`). These
-    // keys are overwhelmingly reactive `cval`s (per-object trafos,
-    // colours, …) and the hot path is `acquire`/`release` ~once per
-    // drawHeader field per RO.
     byAval = new Map();
-    has(av) { return this.byAval.has(av); }
-    entry(av) { return this.byAval.get(av); }
+    has(av, chunkIdx) {
+        return this.byAval.get(av)?.has(chunkIdx) ?? false;
+    }
+    /** True when the pool holds at least one entry for `av` in any
+     *  chunk. Used by the scene's `inputChanged` dispatch to decide
+     *  whether a marking aval is one of our tracked allocations. */
+    hasAny(av) {
+        return (this.byAval.get(av)?.size ?? 0) > 0;
+    }
+    entry(av, chunkIdx) {
+        return this.byAval.get(av)?.get(chunkIdx);
+    }
+    /** First chunk this aval is allocated in, if any. Used by `addRO`
+     *  to prefer co-locating a new RO with its already-allocated
+     *  shared inputs (avoids unnecessary duplication). */
+    firstChunkContaining(av) {
+        const byChunk = this.byAval.get(av);
+        if (byChunk === undefined || byChunk.size === 0)
+            return undefined;
+        return byChunk.keys().next().value;
+    }
     /**
-     * Acquire (or share) an allocation for `aval`. Caller passes the
-     * pre-read `value` (so the pool doesn't need a token) plus the
-     * (`dataBytes`, `typeId`, `length`, `pack`) describing how to lay
-     * it out. If a new allocation is made, the value is packed and
-     * uploaded immediately.
+     * Acquire (or share) an allocation for `aval` in `chunkIdx`.
+     * Returns the byte offset within that chunk's GPUBuffer. If a
+     * fresh allocation is made, the value is packed + uploaded
+     * immediately into the chunk's CPU shadow.
      */
-    acquire(device, arena, av, value, dataBytes, typeId, length, pack) {
-        const existing = this.byAval.get(av);
+    acquire(device, arena, av, chunkIdx, value, dataBytes, typeId, length, pack) {
+        let byChunk = this.byAval.get(av);
+        const existing = byChunk?.get(chunkIdx);
         if (existing !== undefined) {
             existing.refcount++;
             return existing.ref;
         }
-        const ref = arena.alloc(dataBytes);
+        const r = arena.alloc(dataBytes, chunkIdx);
+        // `arena.alloc` may spill to a different chunk if `chunkIdx`'s
+        // GrowBuffer is at its maxCapacity. Callers (heapScene.addRO)
+        // bind a bucket's bind groups to a single chunk's buffer — a
+        // silent spill makes the bucket's drawHeader refs point into
+        // the wrong chunk's buffer (garbage reads / typeId corruption).
+        //
+        // Hard-fail with diagnostic info instead of returning quietly.
+        // The right long-term fix is for addRO to pre-probe the chunk,
+        // open a new bucket bound to the spill chunk, and re-route; but
+        // until that lands, a clear error beats unexplained artefacts.
+        if (r.chunkIdx !== chunkIdx) {
+            throw new Error(`UniformPool.acquire: allocator spilled from chunk ${chunkIdx} to chunk ${r.chunkIdx} ` +
+                `(${dataBytes} bytes). Caller's bucket is bound to chunk ${chunkIdx}; this would silently ` +
+                `corrupt the drawHeader→arena reads. Open a new bucket bound to chunk ${r.chunkIdx} instead.`);
+        }
+        const finalChunk = r.chunkIdx;
         const allocBytes = ALIGN16(ALLOC_HEADER_PAD_TO + dataBytes);
         const buf = new ArrayBuffer(allocBytes);
         const u32 = new Uint32Array(buf);
         const f32 = new Float32Array(buf);
         u32[0] = typeId;
         u32[1] = length;
-        // stride_bytes (offset 8): bytes per element. Lets the VS decode
-        // pick V3- vs V4-tight load expressions for vec4 attributes.
         u32[2] = length > 0 ? Math.floor(dataBytes / length) : 0;
         pack(value, f32, ALLOC_HEADER_PAD_TO / 4);
-        arena.write(ref, new Uint8Array(buf));
+        arena.write(finalChunk, r.off, new Uint8Array(buf));
         void device;
-        this.byAval.set(av, { ref, dataBytes, typeId, pack, refcount: 1 });
-        return ref;
+        if (byChunk === undefined) {
+            byChunk = new Map();
+            this.byAval.set(av, byChunk);
+        }
+        byChunk.set(finalChunk, {
+            chunkIdx: finalChunk, ref: r.off, dataBytes, typeId, pack, refcount: 1,
+        });
+        return r.off;
     }
-    /** Decrement refcount; if zero, free the arena allocation. */
-    release(arena, av) {
-        const e = this.byAval.get(av);
+    release(arena, av, chunkIdx) {
+        const byChunk = this.byAval.get(av);
+        const e = byChunk?.get(chunkIdx);
         if (e === undefined)
             return;
         e.refcount--;
         if (e.refcount > 0)
             return;
-        arena.release(e.ref, ALIGN16(ALLOC_HEADER_PAD_TO + e.dataBytes));
-        this.byAval.delete(av);
+        // BUG FIX: arena.release's third arg is `dataBytes` (raw), and the
+        // chunk's AttributeArena.release internally adds the header padding
+        // via `ALIGN16(ALLOC_HEADER_PAD_TO + dataBytes)`. We MUST pass the
+        // raw data size here — passing pre-aligned `allocBytes` (the old
+        // code) double-pads, freeing 16 extra bytes per release. The freed
+        // surplus then gets coalesced with the neighbouring scalar-uniform
+        // allocs (any 32 B u32/f32) into a single combined block, and the
+        // next attribute alloc handed out from that pool ends up STARTING
+        // 16 B inside the previous alloc → overlapping allocations →
+        // garbage `typeId`/`length` in the attribute header.
+        arena.release(e.chunkIdx, e.ref, e.dataBytes);
+        byChunk.delete(chunkIdx);
+        if (byChunk.size === 0)
+            this.byAval.delete(av);
     }
-    /** Re-pack one entry's data region into the arena's CPU shadow. */
+    /** Re-pack one entry's data region into every chunk that holds
+     *  this aval. When an aval is shared across N chunks (each chunk
+     *  has its own duplicate alloc), every duplicate needs the
+     *  refresh so all the chunks' ROs see the new value. */
     repack(device, arena, av, val) {
-        const e = this.byAval.get(av);
-        if (e === undefined)
+        const byChunk = this.byAval.get(av);
+        if (byChunk === undefined)
             return;
-        const dst = new Float32Array(e.dataBytes / 4);
-        e.pack(val, dst, 0);
-        arena.write(e.ref + ALLOC_HEADER_PAD_TO, new Uint8Array(dst.buffer, dst.byteOffset, e.dataBytes));
+        let dst;
+        for (const e of byChunk.values()) {
+            if (dst === undefined || dst.length !== e.dataBytes / 4) {
+                dst = new Float32Array(e.dataBytes / 4);
+            }
+            e.pack(val, dst, 0);
+            arena.write(e.chunkIdx, e.ref + ALLOC_HEADER_PAD_TO, new Uint8Array(dst.buffer, dst.byteOffset, e.dataBytes));
+        }
         void device;
     }
+    /** Total bytes touched by `repack` for this aval — sum across
+     *  chunks. Used by the dirty-bytes diagnostics. */
+    totalDataBytes(av) {
+        const byChunk = this.byAval.get(av);
+        if (byChunk === undefined)
+            return 0;
+        let s = 0;
+        for (const e of byChunk.values())
+            s += e.dataBytes;
+        return s;
+    }
 }
 // ─── IndexPool ─────────────────────────────────────────────────────────
 /**
@@ -114,7 +177,10 @@ export class UniformPool {
  * `Uint32Array` view collapse to one allocation.
  */
 export class IndexPool {
+    /** Per-aval, per-chunk bookkeeping. Same aval acquired in two
+     *  chunks gets two entries (accepted §3 duplication). */
     byAval = new Map();
+    /** Per-chunk constant-aval value-dedup (§5b in-chunk). */
     byValueKey = new Map();
     bufferIds = new WeakMap();
     nextBufferId = 1;
@@ -126,43 +192,69 @@ export class IndexPool {
         }
         return id;
     }
-    acquire(device, indices, av, arr) {
-        const bound = this.byAval.get(av);
+    firstChunkContaining(av) {
+        const byChunk = this.byAval.get(av);
+        if (byChunk === undefined || byChunk.size === 0)
+            return undefined;
+        return byChunk.keys().next().value;
+    }
+    acquire(device, indices, av, chunkIdx, arr) {
+        let byChunk = this.byAval.get(av);
+        const bound = byChunk?.get(chunkIdx);
         if (bound !== undefined) {
             bound.perAvalCount++;
             bound.entry.totalRefcount++;
-            return { firstIndex: bound.entry.firstIndex, count: bound.entry.count };
+            return { chunkIdx: bound.entry.chunkIdx, firstIndex: bound.entry.firstIndex, count: bound.entry.count };
         }
         let valueKey;
         if (av.isConstant) {
-            valueKey = `${this.bufferIdOf(arr.buffer)}:${arr.byteOffset}:${arr.byteLength}`;
+            // Value-dedup is scoped per chunk — two constant avals in the
+            // same chunk collapse to one allocation; two constant avals in
+            // DIFFERENT chunks each get their own (we can't share across
+            // chunks since the index range lives in the chunk's GPUBuffer).
+            valueKey = `${chunkIdx}:${this.bufferIdOf(arr.buffer)}:${arr.byteOffset}:${arr.byteLength}`;
             const shared = this.byValueKey.get(valueKey);
             if (shared !== undefined) {
                 shared.totalRefcount++;
-                this.byAval.set(av, { entry: shared, perAvalCount: 1 });
-                return { firstIndex: shared.firstIndex, count: shared.count };
+                if (byChunk === undefined) {
+                    byChunk = new Map();
+                    this.byAval.set(av, byChunk);
+                }
+                byChunk.set(chunkIdx, { entry: shared, perAvalCount: 1 });
+                return { chunkIdx: shared.chunkIdx, firstIndex: shared.firstIndex, count: shared.count };
             }
         }
-        const firstIndex = indices.alloc(arr.length);
-        indices.write(firstIndex * 4, new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength));
+        const r = indices.alloc(arr.length, chunkIdx);
+        indices.write(r.chunkIdx, r.off * 4, new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength));
         void device;
-        const entry = { firstIndex, count: arr.length, totalRefcount: 1, valueKey };
-        this.byAval.set(av, { entry, perAvalCount: 1 });
+        const entry = {
+            chunkIdx: r.chunkIdx, firstIndex: r.off, count: arr.length,
+            totalRefcount: 1, valueKey,
+        };
+        if (byChunk === undefined) {
+            byChunk = new Map();
+            this.byAval.set(av, byChunk);
+        }
+        byChunk.set(r.chunkIdx, { entry, perAvalCount: 1 });
         if (valueKey !== undefined)
             this.byValueKey.set(valueKey, entry);
-        return { firstIndex, count: arr.length };
+        return { chunkIdx: r.chunkIdx, firstIndex: r.off, count: arr.length };
     }
-    release(indices, av) {
-        const bound = this.byAval.get(av);
+    release(indices, av, chunkIdx) {
+        const byChunk = this.byAval.get(av);
+        const bound = byChunk?.get(chunkIdx);
         if (bound === undefined)
             return;
         bound.perAvalCount--;
         bound.entry.totalRefcount--;
-        if (bound.perAvalCount === 0)
-            this.byAval.delete(av);
+        if (bound.perAvalCount === 0) {
+            byChunk.delete(chunkIdx);
+            if (byChunk.size === 0)
+                this.byAval.delete(av);
+        }
         if (bound.entry.totalRefcount > 0)
             return;
-        indices.release(bound.entry.firstIndex, bound.entry.count);
+        indices.release(bound.entry.chunkIdx, bound.entry.firstIndex, bound.entry.count);
         if (bound.entry.valueKey !== undefined) {
             this.byValueKey.delete(bound.entry.valueKey);
         }
@@ -180,6 +272,8 @@ export class DrawHeap {
     slotBytes;
     free = [];
     nextSlot = 0;
+    /** DEBUG: tracks slot live/free state. true = live (in use). */
+    live = new Set();
     constructor(buf, slotBytes) {
         this.buf = buf;
         this.slotBytes = slotBytes;
@@ -191,11 +285,21 @@ export class DrawHeap {
     get usedBytes() { return this.nextSlot * this.slotBytes; }
     alloc() {
         const slot = this.free.length > 0 ? this.free.pop() : this.nextSlot++;
+        if (this.live.has(slot)) {
+            throw new Error(`DrawHeap.alloc: returned already-live slot ${slot}`);
+        }
+        this.live.add(slot);
         this.buf.ensureCapacity((slot + 1) * this.slotBytes);
         this.buf.setUsed(Math.max(this.buf.usedBytes, (slot + 1) * this.slotBytes));
         return slot;
     }
-    release(slot) { this.free.push(slot); }
+    release(slot) {
+        if (!this.live.has(slot)) {
+            throw new Error(`DrawHeap.release: slot ${slot} was not live — double-release or release-of-never-allocated.`);
+        }
+        this.live.delete(slot);
+        this.free.push(slot);
+    }
     onResize(cb) { return this.buf.onResize(cb); }
     destroy() { this.buf.destroy(); }
 }
@@ -209,7 +313,12 @@ export class DrawHeap {
 export class AttributeArena {
     buf;
     cursor = 0;
-    freeList = [];
+    freelist = new Freelist();
+    /** DEBUG: tracks every live allocation by start byte → size. Set
+     *  on alloc, cleared on release. Used by `assertNoOverlap()` to
+     *  detect allocator returning overlapping ranges. Enabled in
+     *  development; cheap (one Map insert/delete per alloc). */
+    liveAllocs = new Map();
     /** CPU shadow of the entire GPU buffer; writes go here first then
      *  flush() emits one writeBuffer per dirty contiguous range. */
     shadow;
@@ -227,6 +336,15 @@ export class AttributeArena {
     get buffer() { return this.buf.buffer; }
     get capacity() { return this.buf.capacity; }
     get usedBytes() { return this.cursor; }
+    /** Read 4 u32s from the CPU shadow starting at byte `off`. Used by
+     *  the validator to compare against the GPU's read-back values:
+     *  if CPU shadow is correct but GPU shows garbage → the corruption
+     *  came from a GPU-side write (a compute kernel writing to a wrong
+     *  byte). If both differ from what pool.acquire wrote → CPU-side
+     *  write path is the culprit. */
+    peekShadowU32(off, count) {
+        return new Uint32Array(this.shadow.buffer, this.shadow.byteOffset + off, count);
+    }
     write(dst, data) {
         this.shadow.set(data, dst);
         if (dst < this.dirtyMin)
@@ -246,76 +364,91 @@ export class AttributeArena {
      * Allocate space for one attribute. Returns the byte ref (offset
      * to the header — data lives at ref + 16).
      */
-    alloc(dataBytes) {
+    /** Non-throwing alloc — returns `undefined` when the request
+     *  would exceed the underlying GrowBuffer's `maxCapacity` cap.
+     *  Used by `ChunkedAttributeArena` to probe before spilling to
+     *  the next chunk. */
+    tryAlloc(dataBytes) {
         const allocBytes = ALIGN16(ALLOC_HEADER_PAD_TO + dataBytes);
-        // First-fit reuse from free list.
-        for (let i = 0; i < this.freeList.length; i++) {
-            const f = this.freeList[i];
-            if (f.size >= allocBytes) {
-                const ref = f.off;
-                if (f.size === allocBytes)
-                    this.freeList.splice(i, 1);
-                else {
-                    f.off += allocBytes;
-                    f.size -= allocBytes;
-                }
-                return ref;
-            }
+        const reused = this.freelist.alloc(allocBytes);
+        if (reused !== undefined) {
+            this.recordAlloc(reused, allocBytes, "freelist");
+            return reused;
         }
-        const ref = this.cursor;
-        this.cursor += allocBytes;
-        this.buf.ensureCapacity(this.cursor);
-        this.buf.setUsed(this.cursor);
+        const next = this.cursor + allocBytes;
+        if (next > this.buf.maxCapacity)
+            return undefined;
+        this.cursor = next;
+        this.buf.ensureCapacity(next);
+        this.buf.setUsed(next);
+        const ref = next - allocBytes;
+        this.recordAlloc(ref, allocBytes, "bump");
         return ref;
     }
+    alloc(dataBytes) {
+        const r = this.tryAlloc(dataBytes);
+        if (r === undefined) {
+            throw new Error(`AttributeArena: allocation of ${dataBytes}B (with header alignment) exceeds chunk cap`);
+        }
+        return r;
+    }
     release(ref, dataBytes) {
         const allocBytes = ALIGN16(ALLOC_HEADER_PAD_TO + dataBytes);
-        insertSortedFreeBlock(this.freeList, ref, allocBytes);
-    }
-    onResize(cb) { return this.buf.onResize(cb); }
-    destroy() { this.buf.destroy(); }
-}
-/**
- * Insert `{off, size}` into a free-list kept sorted by `off`, then
- * coalesce with the two immediate neighbours.
- */
-export function insertSortedFreeBlock(freeList, off, size) {
-    let lo = 0, hi = freeList.length;
-    while (lo < hi) {
-        const mid = (lo + hi) >>> 1;
-        if (freeList[mid].off <= off)
-            lo = mid + 1;
-        else
-            hi = mid;
-    }
-    const prev = lo > 0 ? freeList[lo - 1] : undefined;
-    if (prev !== undefined && prev.off + prev.size === off) {
-        prev.size += size;
-        const next = freeList[lo];
-        if (next !== undefined && prev.off + prev.size === next.off) {
-            prev.size += next.size;
-            freeList.splice(lo, 1);
+        const tracked = this.liveAllocs.get(ref);
+        if (tracked === undefined) {
+            throw new Error(`AttributeArena.release: ref=${ref} (size=${allocBytes}) was not in liveAllocs — ` +
+                `double-free or release for an alloc that never happened. ` +
+                `Live alloc count=${this.liveAllocs.size}.`);
+        }
+        if (tracked !== allocBytes) {
+            throw new Error(`AttributeArena.release: size mismatch at ref=${ref} — recorded=${tracked} but ` +
+                `release args→ allocBytes=${allocBytes} (dataBytes=${dataBytes}). ` +
+                `Caller is releasing the wrong size; this WILL corrupt the freelist via over- or under-shrinking.`);
+        }
+        this.liveAllocs.delete(ref);
+        this.freelist.release(ref, allocBytes);
+        // §5: shrink the bump cursor back if release exposed a free
+        // tail touching it (cascading — `freelist.release` may have
+        // coalesced into a single block ending at `cursor`). Reclaims
+        // the high-watermark over time in long-lived high-churn scenes.
+        while (true) {
+            const top = this.freelist.takeBlockEndingAt(this.cursor);
+            if (top === undefined)
+                break;
+            this.cursor = top.off;
+            this.buf.setUsed(this.cursor);
         }
-        return;
     }
-    const next = freeList[lo];
-    if (next !== undefined && off + size === next.off) {
-        next.off = off;
-        next.size += size;
-        return;
+    /** Throws if the just-returned alloc overlaps any live allocation. */
+    recordAlloc(off, size, source) {
+        // Check against every existing live alloc — O(N). Cheap while N
+        // is small (per-tile demos run with ~hundreds of allocs). Wire
+        // off behind an env-flag if it ever becomes a hot path.
+        for (const [liveOff, liveSize] of this.liveAllocs) {
+            // [a, a+sa) vs [b, b+sb) overlap iff a < b+sb && b < a+sa
+            if (off < liveOff + liveSize && liveOff < off + size) {
+                throw new Error(`AttributeArena.tryAlloc(${source}): returned [${off},${off + size}) ` +
+                    `(size=${size}) overlaps live alloc at [${liveOff},${liveOff + liveSize}) ` +
+                    `(size=${liveSize}). Allocator is handing out shared memory!`);
+            }
+        }
+        this.liveAllocs.set(off, size);
     }
-    freeList.splice(lo, 0, { off, size });
+    onResize(cb) { return this.buf.onResize(cb); }
+    destroy() { this.buf.destroy(); }
 }
 // ─── IndexAllocator (element-bump) ─────────────────────────────────────
 /**
  * Element-bump allocator over an index GrowBuffer (units = u32). Each
  * draw's index range is allocated as one block; on release the block
- * is returned to a free list and can be reused first-fit.
+ * is returned to a Freelist and can be reused best-fit.
  */
 export class IndexAllocator {
     buf;
     cursor = 0; // in u32s, not bytes
-    freeList = [];
+    freelist = new Freelist();
+    /** DEBUG: live index allocations tracked by start element. */
+    liveAllocs = new Map();
     shadow;
     dirtyMin = Infinity;
     dirtyMax = 0;
@@ -345,39 +478,81 @@ export class IndexAllocator {
         this.dirtyMin = Infinity;
         this.dirtyMax = 0;
     }
-    alloc(elements) {
-        for (let i = 0; i < this.freeList.length; i++) {
-            const f = this.freeList[i];
-            if (f.size >= elements) {
-                const off = f.off;
-                if (f.size === elements)
-                    this.freeList.splice(i, 1);
-                else {
-                    f.off += elements;
-                    f.size -= elements;
-                }
-                return off;
-            }
+    /** Non-throwing alloc — returns `undefined` when the request
+     *  would exceed the underlying GrowBuffer's `maxCapacity` cap.
+     *  Used by `ChunkedIndexAllocator` to probe before spilling. */
+    tryAlloc(elements) {
+        const reused = this.freelist.alloc(elements);
+        if (reused !== undefined) {
+            this.recordAlloc(reused, elements, "freelist");
+            return reused;
         }
-        const off = this.cursor;
-        this.cursor += elements;
-        this.buf.ensureCapacity(this.cursor * 4);
-        this.buf.setUsed(this.cursor * 4);
+        const nextElts = this.cursor + elements;
+        if (nextElts * 4 > this.buf.maxCapacity)
+            return undefined;
+        this.cursor = nextElts;
+        this.buf.ensureCapacity(nextElts * 4);
+        this.buf.setUsed(nextElts * 4);
+        const off = nextElts - elements;
+        this.recordAlloc(off, elements, "bump");
         return off;
     }
+    recordAlloc(off, size, source) {
+        for (const [liveOff, liveSize] of this.liveAllocs) {
+            if (off < liveOff + liveSize && liveOff < off + size) {
+                throw new Error(`IndexAllocator.tryAlloc(${source}): returned [${off},${off + size}) ` +
+                    `(size=${size}) overlaps live alloc at [${liveOff},${liveOff + liveSize}) ` +
+                    `(size=${liveSize}). Index allocator is handing out shared memory!`);
+            }
+        }
+        this.liveAllocs.set(off, size);
+    }
+    alloc(elements) {
+        const r = this.tryAlloc(elements);
+        if (r === undefined) {
+            throw new Error(`IndexAllocator: allocation of ${elements} elements exceeds chunk cap`);
+        }
+        return r;
+    }
     release(off, elements) {
-        insertSortedFreeBlock(this.freeList, off, elements);
+        const tracked = this.liveAllocs.get(off);
+        if (tracked === undefined) {
+            throw new Error(`IndexAllocator.release: off=${off} (elements=${elements}) was not in ` +
+                `liveAllocs — double-free or release for an alloc that never happened. ` +
+                `Live alloc count=${this.liveAllocs.size}.`);
+        }
+        if (tracked !== elements) {
+            throw new Error(`IndexAllocator.release: size mismatch at off=${off} — recorded=${tracked} ` +
+                `but release elements=${elements}. Will corrupt the freelist.`);
+        }
+        this.liveAllocs.delete(off);
+        this.freelist.release(off, elements);
+        while (true) {
+            const top = this.freelist.takeBlockEndingAt(this.cursor);
+            if (top === undefined)
+                break;
+            this.cursor = top.off;
+            this.buf.setUsed(this.cursor * 4);
+        }
     }
     onResize(cb) { return this.buf.onResize(cb); }
     destroy() { this.buf.destroy(); }
 }
-export function buildArenaState(device, attrBytesHint, idxBytesHint, label, idxExtraUsage = 0) {
-    const attrs = new AttributeArena(new GrowBuffer(device, `${label}/attrs`, GPUBufferUsage.STORAGE, attrBytesHint));
-    const indices = new IndexAllocator(new GrowBuffer(device, `${label}/idx`, GPUBufferUsage.INDEX | idxExtraUsage, idxBytesHint));
+export function buildArenaState(device, attrBytesHint, idxBytesHint, label, idxExtraUsage = 0, maxChunkBytes = undefined) {
+    // §3: cap chunk size at min(adapter's maxStorageBufferBindingSize,
+    // GrowBuffer's DEFAULT_MAX_BUFFER_BYTES). Lets chunks grow as far
+    // as the hardware lets us (typically 2 GiB+ on desktop, ≥ 256 MB
+    // on mobile/integrated) while keeping a sensible internal ceiling.
+    // Caller can override (the heap-demo uses a tiny 4 MB cap to
+    // exercise multi-chunk routing).
+    const adapterCap = device.limits.maxStorageBufferBindingSize;
+    const cap = maxChunkBytes ?? Math.min(adapterCap, DEFAULT_MAX_BUFFER_BYTES);
+    const attrs = new ChunkedAttributeArena(device, `${label}/attrs`, GPUBufferUsage.STORAGE, attrBytesHint, cap);
+    const indices = new ChunkedIndexAllocator(device, `${label}/idx`, GPUBufferUsage.INDEX | idxExtraUsage, idxBytesHint, cap);
     return { attrs, indices };
 }
 export function arenaBytes(arena) {
-    return arena.attrs.usedBytes + arena.indices.usedElements * 4;
+    return arena.attrs.totalUsedBytes() + arena.indices.totalUsedElements() * 4;
 }
 /** Upload a single attribute — header (typeId, length) + data — into the arena at byte offset `ref`. */
 export function writeAttribute(device, buf, ref, typeId, length, data) {