@typeberry/lib 0.1.3-135961b → 0.1.3-462ca77

package/index.cjs

@@ -332,6 +332,19 @@ const Result$1 = {
     },
 };
 
+// about 2GB, the maximum ArrayBuffer length on Chrome confirmed by several sources:
+// - https://issues.chromium.org/issues/40055619
+// - https://stackoverflow.com/a/72124984
+// - https://onnxruntime.ai/docs/tutorials/web/large-models.html#maximum-size-of-arraybuffer
+const MAX_LENGTH$2 = 2145386496;
+function safeAllocUint8Array(length) {
+    if (length > MAX_LENGTH$2) {
+        // biome-ignore lint/suspicious/noConsole: can't have a dependency on logger here
+        console.warn(`Trying to allocate ${length} bytes, which is greater than the maximum of ${MAX_LENGTH$2}.`);
+    }
+    return new Uint8Array(Math.min(MAX_LENGTH$2, length));
+}
+
 /**
  * Utilities for tests.
  */
@@ -572,6 +585,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   DEFAULT_VERSION: DEFAULT_VERSION,
   ErrorsCollector: ErrorsCollector,
   get GpVersion () { return GpVersion; },
+  MAX_LENGTH: MAX_LENGTH$2,
   OK: OK,
   Result: Result$1,
   TEST_COMPARE_USING: TEST_COMPARE_USING,
@@ -586,6 +600,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   isBrowser: isBrowser,
   measure: measure,
   resultToString: resultToString,
+  safeAllocUint8Array: safeAllocUint8Array,
   seeThrough: seeThrough,
   workspacePathFix: workspacePathFix
 });
@@ -609,7 +624,7 @@ class BitVec {
      * Create new [`BitVec`] with all values set to `false`.
      */
     static empty(bitLength) {
-        const data = new Uint8Array(Math.ceil(bitLength / 8));
+        const data = safeAllocUint8Array(Math.ceil(bitLength / 8));
         return new BitVec(data, bitLength);
     }
     byteLength;
@@ -810,7 +825,7 @@ class BytesBlob {
     static blobFromParts(v, ...rest) {
         const vArr = v instanceof Uint8Array ? [v] : v;
         const totalLength = vArr.reduce((a, v) => a + v.length, 0) + rest.reduce((a, v) => a + v.length, 0);
-        const buffer = new Uint8Array(totalLength);
+        const buffer = safeAllocUint8Array(totalLength);
         let offset = 0;
         for (const r of vArr) {
             buffer.set(r, offset);
@@ -883,7 +898,7 @@ class Bytes extends BytesBlob {
     }
     /** Create an empty [`Bytes<X>`] of given length. */
     static zero(len) {
-        return new Bytes(new Uint8Array(len), len);
+        return new Bytes(safeAllocUint8Array(len), len);
     }
     // TODO [ToDr] `fill` should have the argments swapped to align with the rest.
     /** Create a [`Bytes<X>`] with all bytes filled with given input number. */
@@ -3592,7 +3607,7 @@ async function verify(input) {
         return Promise.resolve([]);
     }
     const dataLength = input.reduce((acc, { message, key, signature }) => acc + key.length + signature.length + message.length + 1, 0);
-    const data = new Uint8Array(dataLength);
+    const data = safeAllocUint8Array(dataLength);
     let offset = 0;
     for (const { key, message, signature } of input) {
         data.set(key.raw, offset);
@@ -3684,7 +3699,7 @@ class SimpleAllocator {
 /** An allocator that works by allocating larger (continuous) pages of memory. */
 class PageAllocator {
     hashesPerPage;
-    page = new Uint8Array(0);
+    page = safeAllocUint8Array(0);
     currentHash = 0;
     // TODO [ToDr] Benchmark the performance!
     constructor(hashesPerPage) {
@@ -3695,7 +3710,7 @@ class PageAllocator {
     resetPage() {
         const pageSizeBytes = this.hashesPerPage * HASH_SIZE;
         this.currentHash = 0;
-        this.page = new Uint8Array(pageSizeBytes);
+        this.page = safeAllocUint8Array(pageSizeBytes);
     }
     emptyHash() {
         const startIdx = this.currentHash * HASH_SIZE;
@@ -10463,7 +10478,7 @@ class SerializedService {
     getStorage(rawKey) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
             const SERVICE_ID_BYTES = 4;
-            const serviceIdAndKey = new Uint8Array(SERVICE_ID_BYTES + rawKey.length);
+            const serviceIdAndKey = safeAllocUint8Array(SERVICE_ID_BYTES + rawKey.length);
             serviceIdAndKey.set(u32AsLeBytes(this.serviceId));
             serviceIdAndKey.set(rawKey.raw, SERVICE_ID_BYTES);
             const key = asOpaqueType(BytesBlob.blobFrom(hashBytes(serviceIdAndKey).raw));
@@ -10548,7 +10563,7 @@ class TrieNode {
     raw;
     constructor(
     /** Exactly 512 bits / 64 bytes */
-    raw = new Uint8Array(TRIE_NODE_BYTES)) {
+    raw = safeAllocUint8Array(TRIE_NODE_BYTES)) {
         this.raw = raw;
     }
     /** Returns the type of the node */
@@ -11799,7 +11814,7 @@ function padAndEncodeData(input) {
     const paddedLength = Math.ceil(input.length / PIECE_SIZE) * PIECE_SIZE;
     let padded = input;
     if (input.length !== paddedLength) {
-        padded = BytesBlob.blobFrom(new Uint8Array(paddedLength));
+        padded = BytesBlob.blobFrom(safeAllocUint8Array(paddedLength));
         padded.raw.set(input.raw, 0);
     }
     return chunkingFunction(padded);
@@ -11845,7 +11860,7 @@ function decodeData(input) {
  */
 function encodePoints(input) {
     const result = [];
-    const data = new Uint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
+    const data = safeAllocUint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
     // add original shards to the result
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const pointStart = POINT_LENGTH * i;
@@ -11861,7 +11876,7 @@ function encodePoints(input) {
     const encodedData = encodedResult.take_data();
     for (let i = 0; i < N_CHUNKS_REDUNDANCY; i++) {
         const pointIndex = i * POINT_ALIGNMENT;
-        const redundancyPoint = new Uint8Array(POINT_LENGTH);
+        const redundancyPoint = safeAllocUint8Array(POINT_LENGTH);
         for (let j = 0; j < POINT_LENGTH; j++) {
             redundancyPoint[j] = encodedData[pointIndex + j * HALF_POINT_SIZE];
         }
@@ -11876,7 +11891,7 @@ function encodePoints(input) {
  */
 function decodePiece(input) {
     const result = Bytes.zero(PIECE_SIZE);
-    const data = new Uint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
+    const data = safeAllocUint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
     const indices = new Uint16Array(input.length);
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const [index, points] = input[i];
@@ -11992,7 +12007,7 @@ function lace(input) {
         return BytesBlob.empty();
     }
     const n = input[0].length;
-    const result = BytesBlob.blobFrom(new Uint8Array(k * n));
+    const result = BytesBlob.blobFrom(safeAllocUint8Array(k * n));
     for (let i = 0; i < k; i++) {
         const entry = input[i].raw;
         for (let j = 0; j < n; j++) {
@@ -13271,7 +13286,7 @@ class Registers {
     bytes;
     asSigned;
     asUnsigned;
-    constructor(bytes = new Uint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
+    constructor(bytes = safeAllocUint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
         this.bytes = bytes;
         check `${bytes.length === NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT} Invalid size of registers array.`;
         this.asSigned = new BigInt64Array(bytes.buffer, bytes.byteOffset);
@@ -13424,7 +13439,7 @@ class Mask {
         return Math.min(this.lookupTableForward[index] ?? 0, MAX_INSTRUCTION_DISTANCE);
     }
     buildLookupTableForward(mask) {
-        const table = new Uint8Array(mask.bitLength);
+        const table = safeAllocUint8Array(mask.bitLength);
         let lastInstructionOffset = 0;
         for (let i = mask.bitLength - 1; i >= 0; i--) {
             if (mask.isSet(i)) {
@@ -16959,7 +16974,7 @@ class HostCalls {
             const regs = pvmInstance.getRegisters();
             const maybeAddress = regs.getLowerU32(7);
             const maybeLength = regs.getLowerU32(8);
-            const result = new Uint8Array(maybeLength);
+            const result = safeAllocUint8Array(maybeLength);
             const startAddress = tryAsMemoryIndex(maybeAddress);
             const loadResult = memory.loadInto(result, startAddress);
             if (loadResult.isError) {
@@ -17308,14 +17323,14 @@ class DebuggerAdapter {
         const page = this.pvm.getMemoryPage(pageNumber);
         if (page === null) {
             // page wasn't allocated so we return an empty page
-            return new Uint8Array(PAGE_SIZE$1);
+            return safeAllocUint8Array(PAGE_SIZE$1);
         }
         if (page.length === PAGE_SIZE$1) {
             // page was allocated and has a proper size so we can simply return it
             return page;
         }
         // page was allocated but it is shorter than PAGE_SIZE so we have to extend it
-        const fullPage = new Uint8Array(PAGE_SIZE$1);
+        const fullPage = safeAllocUint8Array(PAGE_SIZE$1);
         fullPage.set(page);
         return fullPage;
     }
@@ -17459,7 +17474,7 @@ function fisherYatesShuffle(arr, entropy) {
 }
 function hashToNumberSequence(entropy, length) {
     const result = new Array(length);
-    const randomBytes = new Uint8Array(ENTROPY_BYTES + 4);
+    const randomBytes = safeAllocUint8Array(ENTROPY_BYTES + 4);
     randomBytes.set(entropy.raw);
     for (let i = 0; i < length; i++) {
         randomBytes.set(u32AsLeBytes(tryAsU32(Math.floor(i / 8))), ENTROPY_BYTES);

package/index.d.ts

@@ -420,6 +420,20 @@ declare const Result$2 = {
   },
 };
 
+// about 2GB, the maximum ArrayBuffer length on Chrome confirmed by several sources:
+// - https://issues.chromium.org/issues/40055619
+// - https://stackoverflow.com/a/72124984
+// - https://onnxruntime.ai/docs/tutorials/web/large-models.html#maximum-size-of-arraybuffer
+declare const MAX_LENGTH$1 = 2145386496;
+
+declare function safeAllocUint8Array(length: number) {
+  if (length > MAX_LENGTH) {
+    // biome-ignore lint/suspicious/noConsole: can't have a dependency on logger here
+    console.warn(`Trying to allocate ${length} bytes, which is greater than the maximum of ${MAX_LENGTH}.`);
+  }
+  return new Uint8Array(Math.min(MAX_LENGTH, length));
+}
+
 /**
  * Utilities for tests.
  */
@@ -755,11 +769,12 @@ declare const index$u_oomWarningPrinted: typeof oomWarningPrinted;
 declare const index$u_parseCurrentSuite: typeof parseCurrentSuite;
 declare const index$u_parseCurrentVersion: typeof parseCurrentVersion;
 declare const index$u_resultToString: typeof resultToString;
+declare const index$u_safeAllocUint8Array: typeof safeAllocUint8Array;
 declare const index$u_seeThrough: typeof seeThrough;
 declare const index$u_trimStack: typeof trimStack;
 declare const index$u_workspacePathFix: typeof workspacePathFix;
 declare namespace index$u {
-  export { index$u_ALL_VERSIONS_IN_ORDER as ALL_VERSIONS_IN_ORDER, index$u_CURRENT_SUITE as CURRENT_SUITE, index$u_CURRENT_VERSION as CURRENT_VERSION, index$u_Compatibility as Compatibility, index$u_DEFAULT_SUITE as DEFAULT_SUITE, index$u_DEFAULT_VERSION as DEFAULT_VERSION, index$u_ErrorsCollector as ErrorsCollector, index$u_GpVersion as GpVersion, Result$2 as Result, index$u_RichTaggedError as RichTaggedError, index$u_TEST_COMPARE_USING as TEST_COMPARE_USING, index$u_TestSuite as TestSuite, index$u_WithDebug as WithDebug, index$u___OPAQUE_TYPE__ as __OPAQUE_TYPE__, index$u_asOpaqueType as asOpaqueType, index$u_assertEmpty as assertEmpty, index$u_assertNever as assertNever, index$u_callCompareFunction as callCompareFunction, index$u_check as check, index$u_deepEqual as deepEqual, index$u_getAllKeysSorted as getAllKeysSorted, index$u_inspect as inspect, index$u_isBrowser as isBrowser, index$u_isResult as isResult, index$u_isTaggedError as isTaggedError, index$u_maybeTaggedErrorToString as maybeTaggedErrorToString, index$u_measure as measure, index$u_oomWarningPrinted as oomWarningPrinted, index$u_parseCurrentSuite as parseCurrentSuite, index$u_parseCurrentVersion as parseCurrentVersion, index$u_resultToString as resultToString, index$u_seeThrough as seeThrough, index$u_trimStack as trimStack, index$u_workspacePathFix as workspacePathFix };
+  export { index$u_ALL_VERSIONS_IN_ORDER as ALL_VERSIONS_IN_ORDER, index$u_CURRENT_SUITE as CURRENT_SUITE, index$u_CURRENT_VERSION as CURRENT_VERSION, index$u_Compatibility as Compatibility, index$u_DEFAULT_SUITE as DEFAULT_SUITE, index$u_DEFAULT_VERSION as DEFAULT_VERSION, index$u_ErrorsCollector as ErrorsCollector, index$u_GpVersion as GpVersion, MAX_LENGTH$1 as MAX_LENGTH, Result$2 as Result, index$u_RichTaggedError as RichTaggedError, index$u_TEST_COMPARE_USING as TEST_COMPARE_USING, index$u_TestSuite as TestSuite, index$u_WithDebug as WithDebug, index$u___OPAQUE_TYPE__ as __OPAQUE_TYPE__, index$u_asOpaqueType as asOpaqueType, index$u_assertEmpty as assertEmpty, index$u_assertNever as assertNever, index$u_callCompareFunction as callCompareFunction, index$u_check as check, index$u_deepEqual as deepEqual, index$u_getAllKeysSorted as getAllKeysSorted, index$u_inspect as inspect, index$u_isBrowser as isBrowser, index$u_isResult as isResult, index$u_isTaggedError as isTaggedError, index$u_maybeTaggedErrorToString as maybeTaggedErrorToString, index$u_measure as measure, index$u_oomWarningPrinted as oomWarningPrinted, index$u_parseCurrentSuite as parseCurrentSuite, index$u_parseCurrentVersion as parseCurrentVersion, index$u_resultToString as resultToString, index$u_safeAllocUint8Array as safeAllocUint8Array, index$u_seeThrough as seeThrough, index$u_trimStack as trimStack, index$u_workspacePathFix as workspacePathFix };
   export type { index$u_DeepEqualOptions as DeepEqualOptions, index$u_EnumMapping as EnumMapping, index$u_ErrorResult as ErrorResult, index$u_OK as OK, index$u_OkResult as OkResult, index$u_Opaque as Opaque, index$u_StringLiteral as StringLiteral, index$u_TaggedError as TaggedError, index$u_TokenOf as TokenOf, index$u_Uninstantiable as Uninstantiable, index$u_WithOpaque as WithOpaque };
 }
 
@@ -929,7 +944,7 @@ declare class BytesBlob {
   static blobFromParts(v: Uint8Array | Uint8Array[], ...rest: Uint8Array[]) {
     const vArr = v instanceof Uint8Array ? [v] : v;
     const totalLength = vArr.reduce((a, v) => a + v.length, 0) + rest.reduce((a, v) => a + v.length, 0);
-    const buffer = new Uint8Array(totalLength);
+    const buffer = safeAllocUint8Array(totalLength);
     let offset = 0;
     for (const r of vArr) {
       buffer.set(r, offset);
@@ -1012,7 +1027,7 @@ declare class Bytes<T extends number> extends BytesBlob {
 
   /** Create an empty [`Bytes<X>`] of given length. */
   static zero<X extends number>(len: X): Bytes<X> {
-    return new Bytes(new Uint8Array(len), len);
+    return new Bytes(safeAllocUint8Array(len), len);
   }
 
   // TODO [ToDr] `fill` should have the argments swapped to align with the rest.
@@ -1133,7 +1148,7 @@ declare class BitVec {
    * Create new [`BitVec`] with all values set to `false`.
    */
   static empty(bitLength: number) {
-    const data = new Uint8Array(Math.ceil(bitLength / 8));
+    const data = safeAllocUint8Array(Math.ceil(bitLength / 8));
     return new BitVec(data, bitLength);
   }
 
@@ -3531,7 +3546,7 @@ declare class SimpleAllocator implements HashAllocator {
 
 /** An allocator that works by allocating larger (continuous) pages of memory. */
 declare class PageAllocator implements HashAllocator {
-  private page: Uint8Array = new Uint8Array(0);
+  private page: Uint8Array = safeAllocUint8Array(0);
   private currentHash = 0;
 
   // TODO [ToDr] Benchmark the performance!
@@ -3543,7 +3558,7 @@ declare class PageAllocator implements HashAllocator {
   private resetPage() {
     const pageSizeBytes = this.hashesPerPage * HASH_SIZE;
     this.currentHash = 0;
-    this.page = new Uint8Array(pageSizeBytes);
+    this.page = safeAllocUint8Array(pageSizeBytes);
   }
 
   emptyHash(): OpaqueHash {
@@ -4735,7 +4750,7 @@ declare async function verify<T extends BytesBlob>(input: Input<T>[]): Promise<b
     (acc, { message, key, signature }) => acc + key.length + signature.length + message.length + 1,
     0,
   );
-  const data = new Uint8Array(dataLength);
+  const data = safeAllocUint8Array(dataLength);
 
   let offset = 0;
 
@@ -8373,7 +8388,7 @@ declare enum NodeType {
 declare class TrieNode {
   constructor(
     /** Exactly 512 bits / 64 bytes */
-    public readonly raw: Uint8Array = new Uint8Array(TRIE_NODE_BYTES),
+    public readonly raw: Uint8Array = safeAllocUint8Array(TRIE_NODE_BYTES),
   ) {}
 
   /** Returns the type of the node */
@@ -12172,7 +12187,7 @@ declare class SerializedService implements Service {
   getStorage(rawKey: StorageKey): BytesBlob | null {
     if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
       const SERVICE_ID_BYTES = 4;
-      const serviceIdAndKey = new Uint8Array(SERVICE_ID_BYTES + rawKey.length);
+      const serviceIdAndKey = safeAllocUint8Array(SERVICE_ID_BYTES + rawKey.length);
       serviceIdAndKey.set(u32AsLeBytes(this.serviceId));
       serviceIdAndKey.set(rawKey.raw, SERVICE_ID_BYTES);
       const key: StorageKey = asOpaqueType(BytesBlob.blobFrom(blake2b.hashBytes(serviceIdAndKey).raw));
@@ -12573,7 +12588,7 @@ declare function padAndEncodeData(input: BytesBlob) {
   const paddedLength = Math.ceil(input.length / PIECE_SIZE) * PIECE_SIZE;
   let padded = input;
   if (input.length !== paddedLength) {
-    padded = BytesBlob.blobFrom(new Uint8Array(paddedLength));
+    padded = BytesBlob.blobFrom(safeAllocUint8Array(paddedLength));
     padded.raw.set(input.raw, 0);
   }
   return chunkingFunction(padded);
@@ -12629,7 +12644,7 @@ declare function decodeData(input: FixedSizeArray<[number, BytesBlob], N_CHUNKS_
  */
 declare function encodePoints(input: Bytes<PIECE_SIZE>): FixedSizeArray<Bytes<POINT_LENGTH>, N_CHUNKS_TOTAL> {
   const result: Bytes<POINT_LENGTH>[] = [];
-  const data = new Uint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
+  const data = safeAllocUint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
 
   // add original shards to the result
   for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
@@ -12649,7 +12664,7 @@ declare function encodePoints(input: Bytes<PIECE_SIZE>): FixedSizeArray<Bytes<PO
   for (let i = 0; i < N_CHUNKS_REDUNDANCY; i++) {
     const pointIndex = i * POINT_ALIGNMENT;
 
-    const redundancyPoint = new Uint8Array(POINT_LENGTH);
+    const redundancyPoint = safeAllocUint8Array(POINT_LENGTH);
     for (let j = 0; j < POINT_LENGTH; j++) {
       redundancyPoint[j] = encodedData[pointIndex + j * HALF_POINT_SIZE];
     }
@@ -12669,7 +12684,7 @@ declare function decodePiece(
 ): Bytes<PIECE_SIZE> {
   const result = Bytes.zero(PIECE_SIZE);
 
-  const data = new Uint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
+  const data = safeAllocUint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
   const indices = new Uint16Array(input.length);
 
   for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
@@ -12796,7 +12811,7 @@ declare function lace<N extends number, K extends number>(input: FixedSizeArray<
     return BytesBlob.empty();
   }
   const n = input[0].length;
-  const result = BytesBlob.blobFrom(new Uint8Array(k * n));
+  const result = BytesBlob.blobFrom(safeAllocUint8Array(k * n));
   for (let i = 0; i < k; i++) {
     const entry = input[i].raw;
     for (let j = 0; j < n; j++) {
@@ -13868,7 +13883,7 @@ declare class Mask {
   }
 
   private buildLookupTableForward(mask: BitVec) {
-    const table = new Uint8Array(mask.bitLength);
+    const table = safeAllocUint8Array(mask.bitLength);
     let lastInstructionOffset = 0;
     for (let i = mask.bitLength - 1; i >= 0; i--) {
       if (mask.isSet(i)) {
@@ -14012,7 +14027,7 @@ declare class Registers {
   private asSigned: BigInt64Array;
   private asUnsigned: BigUint64Array;
 
-  constructor(private readonly bytes = new Uint8Array(NO_OF_REGISTERS << REGISTER_SIZE_SHIFT)) {
+  constructor(private readonly bytes = safeAllocUint8Array(NO_OF_REGISTERS << REGISTER_SIZE_SHIFT)) {
     check`${bytes.length === NO_OF_REGISTERS << REGISTER_SIZE_SHIFT} Invalid size of registers array.`;
     this.asSigned = new BigInt64Array(bytes.buffer, bytes.byteOffset);
     this.asUnsigned = new BigUint64Array(bytes.buffer, bytes.byteOffset);
@@ -18239,7 +18254,7 @@ declare class HostCalls {
       const maybeAddress = regs.getLowerU32(7);
       const maybeLength = regs.getLowerU32(8);
 
-      const result = new Uint8Array(maybeLength);
+      const result = safeAllocUint8Array(maybeLength);
       const startAddress = tryAsMemoryIndex(maybeAddress);
       const loadResult = memory.loadInto(result, startAddress);
 
@@ -18678,7 +18693,7 @@ declare class DebuggerAdapter {
 
     if (page === null) {
       // page wasn't allocated so we return an empty page
-      return new Uint8Array(PAGE_SIZE);
+      return safeAllocUint8Array(PAGE_SIZE);
     }
 
     if (page.length === PAGE_SIZE) {
@@ -18687,7 +18702,7 @@ declare class DebuggerAdapter {
     }
 
     // page was allocated but it is shorter than PAGE_SIZE so we have to extend it
-    const fullPage = new Uint8Array(PAGE_SIZE);
+    const fullPage = safeAllocUint8Array(PAGE_SIZE);
     fullPage.set(page);
     return fullPage;
   }

package/index.js

@@ -329,6 +329,19 @@ const Result$1 = {
     },
 };
 
+// about 2GB, the maximum ArrayBuffer length on Chrome confirmed by several sources:
+// - https://issues.chromium.org/issues/40055619
+// - https://stackoverflow.com/a/72124984
+// - https://onnxruntime.ai/docs/tutorials/web/large-models.html#maximum-size-of-arraybuffer
+const MAX_LENGTH$2 = 2145386496;
+function safeAllocUint8Array(length) {
+    if (length > MAX_LENGTH$2) {
+        // biome-ignore lint/suspicious/noConsole: can't have a dependency on logger here
+        console.warn(`Trying to allocate ${length} bytes, which is greater than the maximum of ${MAX_LENGTH$2}.`);
+    }
+    return new Uint8Array(Math.min(MAX_LENGTH$2, length));
+}
+
 /**
  * Utilities for tests.
  */
@@ -569,6 +582,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   DEFAULT_VERSION: DEFAULT_VERSION,
   ErrorsCollector: ErrorsCollector,
   get GpVersion () { return GpVersion; },
+  MAX_LENGTH: MAX_LENGTH$2,
   OK: OK,
   Result: Result$1,
   TEST_COMPARE_USING: TEST_COMPARE_USING,
@@ -583,6 +597,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   isBrowser: isBrowser,
   measure: measure,
   resultToString: resultToString,
+  safeAllocUint8Array: safeAllocUint8Array,
   seeThrough: seeThrough,
   workspacePathFix: workspacePathFix
 });
@@ -606,7 +621,7 @@ class BitVec {
      * Create new [`BitVec`] with all values set to `false`.
      */
     static empty(bitLength) {
-        const data = new Uint8Array(Math.ceil(bitLength / 8));
+        const data = safeAllocUint8Array(Math.ceil(bitLength / 8));
         return new BitVec(data, bitLength);
     }
     byteLength;
@@ -807,7 +822,7 @@ class BytesBlob {
     static blobFromParts(v, ...rest) {
         const vArr = v instanceof Uint8Array ? [v] : v;
         const totalLength = vArr.reduce((a, v) => a + v.length, 0) + rest.reduce((a, v) => a + v.length, 0);
-        const buffer = new Uint8Array(totalLength);
+        const buffer = safeAllocUint8Array(totalLength);
         let offset = 0;
         for (const r of vArr) {
             buffer.set(r, offset);
@@ -880,7 +895,7 @@ class Bytes extends BytesBlob {
     }
     /** Create an empty [`Bytes<X>`] of given length. */
     static zero(len) {
-        return new Bytes(new Uint8Array(len), len);
+        return new Bytes(safeAllocUint8Array(len), len);
     }
     // TODO [ToDr] `fill` should have the argments swapped to align with the rest.
     /** Create a [`Bytes<X>`] with all bytes filled with given input number. */
@@ -3589,7 +3604,7 @@ async function verify(input) {
         return Promise.resolve([]);
     }
     const dataLength = input.reduce((acc, { message, key, signature }) => acc + key.length + signature.length + message.length + 1, 0);
-    const data = new Uint8Array(dataLength);
+    const data = safeAllocUint8Array(dataLength);
     let offset = 0;
     for (const { key, message, signature } of input) {
         data.set(key.raw, offset);
@@ -3681,7 +3696,7 @@ class SimpleAllocator {
 /** An allocator that works by allocating larger (continuous) pages of memory. */
 class PageAllocator {
     hashesPerPage;
-    page = new Uint8Array(0);
+    page = safeAllocUint8Array(0);
     currentHash = 0;
     // TODO [ToDr] Benchmark the performance!
     constructor(hashesPerPage) {
@@ -3692,7 +3707,7 @@ class PageAllocator {
     resetPage() {
         const pageSizeBytes = this.hashesPerPage * HASH_SIZE;
         this.currentHash = 0;
-        this.page = new Uint8Array(pageSizeBytes);
+        this.page = safeAllocUint8Array(pageSizeBytes);
     }
     emptyHash() {
         const startIdx = this.currentHash * HASH_SIZE;
@@ -10460,7 +10475,7 @@ class SerializedService {
     getStorage(rawKey) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
             const SERVICE_ID_BYTES = 4;
-            const serviceIdAndKey = new Uint8Array(SERVICE_ID_BYTES + rawKey.length);
+            const serviceIdAndKey = safeAllocUint8Array(SERVICE_ID_BYTES + rawKey.length);
             serviceIdAndKey.set(u32AsLeBytes(this.serviceId));
             serviceIdAndKey.set(rawKey.raw, SERVICE_ID_BYTES);
             const key = asOpaqueType(BytesBlob.blobFrom(hashBytes(serviceIdAndKey).raw));
@@ -10545,7 +10560,7 @@ class TrieNode {
     raw;
     constructor(
     /** Exactly 512 bits / 64 bytes */
-    raw = new Uint8Array(TRIE_NODE_BYTES)) {
+    raw = safeAllocUint8Array(TRIE_NODE_BYTES)) {
         this.raw = raw;
     }
     /** Returns the type of the node */
@@ -11796,7 +11811,7 @@ function padAndEncodeData(input) {
     const paddedLength = Math.ceil(input.length / PIECE_SIZE) * PIECE_SIZE;
     let padded = input;
     if (input.length !== paddedLength) {
-        padded = BytesBlob.blobFrom(new Uint8Array(paddedLength));
+        padded = BytesBlob.blobFrom(safeAllocUint8Array(paddedLength));
         padded.raw.set(input.raw, 0);
     }
     return chunkingFunction(padded);
@@ -11842,7 +11857,7 @@ function decodeData(input) {
  */
 function encodePoints(input) {
     const result = [];
-    const data = new Uint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
+    const data = safeAllocUint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
     // add original shards to the result
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const pointStart = POINT_LENGTH * i;
@@ -11858,7 +11873,7 @@ function encodePoints(input) {
     const encodedData = encodedResult.take_data();
     for (let i = 0; i < N_CHUNKS_REDUNDANCY; i++) {
         const pointIndex = i * POINT_ALIGNMENT;
-        const redundancyPoint = new Uint8Array(POINT_LENGTH);
+        const redundancyPoint = safeAllocUint8Array(POINT_LENGTH);
         for (let j = 0; j < POINT_LENGTH; j++) {
             redundancyPoint[j] = encodedData[pointIndex + j * HALF_POINT_SIZE];
         }
@@ -11873,7 +11888,7 @@ function encodePoints(input) {
  */
 function decodePiece(input) {
     const result = Bytes.zero(PIECE_SIZE);
-    const data = new Uint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
+    const data = safeAllocUint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
     const indices = new Uint16Array(input.length);
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const [index, points] = input[i];
@@ -11989,7 +12004,7 @@ function lace(input) {
         return BytesBlob.empty();
     }
     const n = input[0].length;
-    const result = BytesBlob.blobFrom(new Uint8Array(k * n));
+    const result = BytesBlob.blobFrom(safeAllocUint8Array(k * n));
     for (let i = 0; i < k; i++) {
         const entry = input[i].raw;
         for (let j = 0; j < n; j++) {
@@ -13268,7 +13283,7 @@ class Registers {
     bytes;
     asSigned;
     asUnsigned;
-    constructor(bytes = new Uint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
+    constructor(bytes = safeAllocUint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
         this.bytes = bytes;
         check `${bytes.length === NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT} Invalid size of registers array.`;
         this.asSigned = new BigInt64Array(bytes.buffer, bytes.byteOffset);
@@ -13421,7 +13436,7 @@ class Mask {
         return Math.min(this.lookupTableForward[index] ?? 0, MAX_INSTRUCTION_DISTANCE);
     }
     buildLookupTableForward(mask) {
-        const table = new Uint8Array(mask.bitLength);
+        const table = safeAllocUint8Array(mask.bitLength);
         let lastInstructionOffset = 0;
         for (let i = mask.bitLength - 1; i >= 0; i--) {
             if (mask.isSet(i)) {
@@ -16956,7 +16971,7 @@ class HostCalls {
             const regs = pvmInstance.getRegisters();
             const maybeAddress = regs.getLowerU32(7);
             const maybeLength = regs.getLowerU32(8);
-            const result = new Uint8Array(maybeLength);
+            const result = safeAllocUint8Array(maybeLength);
             const startAddress = tryAsMemoryIndex(maybeAddress);
             const loadResult = memory.loadInto(result, startAddress);
             if (loadResult.isError) {
@@ -17305,14 +17320,14 @@ class DebuggerAdapter {
         const page = this.pvm.getMemoryPage(pageNumber);
         if (page === null) {
             // page wasn't allocated so we return an empty page
-            return new Uint8Array(PAGE_SIZE$1);
+            return safeAllocUint8Array(PAGE_SIZE$1);
         }
         if (page.length === PAGE_SIZE$1) {
             // page was allocated and has a proper size so we can simply return it
             return page;
         }
         // page was allocated but it is shorter than PAGE_SIZE so we have to extend it
-        const fullPage = new Uint8Array(PAGE_SIZE$1);
+        const fullPage = safeAllocUint8Array(PAGE_SIZE$1);
         fullPage.set(page);
         return fullPage;
     }
@@ -17456,7 +17471,7 @@ function fisherYatesShuffle(arr, entropy) {
 }
 function hashToNumberSequence(entropy, length) {
     const result = new Array(length);
-    const randomBytes = new Uint8Array(ENTROPY_BYTES + 4);
+    const randomBytes = safeAllocUint8Array(ENTROPY_BYTES + 4);
     randomBytes.set(entropy.raw);
     for (let i = 0; i < length; i++) {
         randomBytes.set(u32AsLeBytes(tryAsU32(Math.floor(i / 8))), ENTROPY_BYTES);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@typeberry/lib",
-  "version": "0.1.3-135961b",
+  "version": "0.1.3-462ca77",
   "main": "index.js",
   "author": "Fluffy Labs",
   "license": "MPL-2.0",