@polkadot/types-codec 9.11.2 → 9.12.1

package/LICENSE

@@ -0,0 +1,201 @@
+                              Apache License
+                        Version 2.0, January 2004
+                    http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+  "License" shall mean the terms and conditions for use, reproduction,
+  and distribution as defined by Sections 1 through 9 of this document.
+
+  "Licensor" shall mean the copyright owner or entity authorized by
+  the copyright owner that is granting the License.
+
+  "Legal Entity" shall mean the union of the acting entity and all
+  other entities that control, are controlled by, or are under common
+  control with that entity. For the purposes of this definition,
+  "control" means (i) the power, direct or indirect, to cause the
+  direction or management of such entity, whether by contract or
+  otherwise, or (ii) ownership of fifty percent (50%) or more of the
+  outstanding shares, or (iii) beneficial ownership of such entity.
+
+  "You" (or "Your") shall mean an individual or Legal Entity
+  exercising permissions granted by this License.
+
+  "Source" form shall mean the preferred form for making modifications,
+  including but not limited to software source code, documentation
+  source, and configuration files.
+
+  "Object" form shall mean any form resulting from mechanical
+  transformation or translation of a Source form, including but
+  not limited to compiled object code, generated documentation,
+  and conversions to other media types.
+
+  "Work" shall mean the work of authorship, whether in Source or
+  Object form, made available under the License, as indicated by a
+  copyright notice that is included in or attached to the work
+  (an example is provided in the Appendix below).
+
+  "Derivative Works" shall mean any work, whether in Source or Object
+  form, that is based on (or derived from) the Work and for which the
+  editorial revisions, annotations, elaborations, or other modifications
+  represent, as a whole, an original work of authorship. For the purposes
+  of this License, Derivative Works shall not include works that remain
+  separable from, or merely link (or bind by name) to the interfaces of,
+  the Work and Derivative Works thereof.
+
+  "Contribution" shall mean any work of authorship, including
+  the original version of the Work and any modifications or additions
+  to that Work or Derivative Works thereof, that is intentionally
+  submitted to Licensor for inclusion in the Work by the copyright owner
+  or by an individual or Legal Entity authorized to submit on behalf of
+  the copyright owner. For the purposes of this definition, "submitted"
+  means any form of electronic, verbal, or written communication sent
+  to the Licensor or its representatives, including but not limited to
+  communication on electronic mailing lists, source code control systems,
+  and issue tracking systems that are managed by, or on behalf of, the
+  Licensor for the purpose of discussing and improving the Work, but
+  excluding communication that is conspicuously marked or otherwise
+  designated in writing by the copyright owner as "Not a Contribution."
+
+  "Contributor" shall mean Licensor and any individual or Legal Entity
+  on behalf of whom a Contribution has been received by Licensor and
+  subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+  this License, each Contributor hereby grants to You a perpetual,
+  worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+  copyright license to reproduce, prepare Derivative Works of,
+  publicly display, publicly perform, sublicense, and distribute the
+  Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+  this License, each Contributor hereby grants to You a perpetual,
+  worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+  (except as stated in this section) patent license to make, have made,
+  use, offer to sell, sell, import, and otherwise transfer the Work,
+  where such license applies only to those patent claims licensable
+  by such Contributor that are necessarily infringed by their
+  Contribution(s) alone or by combination of their Contribution(s)
+  with the Work to which such Contribution(s) was submitted. If You
+  institute patent litigation against any entity (including a
+  cross-claim or counterclaim in a lawsuit) alleging that the Work
+  or a Contribution incorporated within the Work constitutes direct
+  or contributory patent infringement, then any patent licenses
+  granted to You under this License for that Work shall terminate
+  as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+  Work or Derivative Works thereof in any medium, with or without
+  modifications, and in Source or Object form, provided that You
+  meet the following conditions:
+
+  (a) You must give any other recipients of the Work or
+      Derivative Works a copy of this License; and
+
+  (b) You must cause any modified files to carry prominent notices
+      stating that You changed the files; and
+
+  (c) You must retain, in the Source form of any Derivative Works
+      that You distribute, all copyright, patent, trademark, and
+      attribution notices from the Source form of the Work,
+      excluding those notices that do not pertain to any part of
+      the Derivative Works; and
+
+  (d) If the Work includes a "NOTICE" text file as part of its
+      distribution, then any Derivative Works that You distribute must
+      include a readable copy of the attribution notices contained
+      within such NOTICE file, excluding those notices that do not
+      pertain to any part of the Derivative Works, in at least one
+      of the following places: within a NOTICE text file distributed
+      as part of the Derivative Works; within the Source form or
+      documentation, if provided along with the Derivative Works; or,
+      within a display generated by the Derivative Works, if and
+      wherever such third-party notices normally appear. The contents
+      of the NOTICE file are for informational purposes only and
+      do not modify the License. You may add Your own attribution
+      notices within Derivative Works that You distribute, alongside
+      or as an addendum to the NOTICE text from the Work, provided
+      that such additional attribution notices cannot be construed
+      as modifying the License.
+
+  You may add Your own copyright statement to Your modifications and
+  may provide additional or different license terms and conditions
+  for use, reproduction, or distribution of Your modifications, or
+  for any such Derivative Works as a whole, provided Your use,
+  reproduction, and distribution of the Work otherwise complies with
+  the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+  any Contribution intentionally submitted for inclusion in the Work
+  by You to the Licensor shall be under the terms and conditions of
+  this License, without any additional terms or conditions.
+  Notwithstanding the above, nothing herein shall supersede or modify
+  the terms of any separate license agreement you may have executed
+  with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+  names, trademarks, service marks, or product names of the Licensor,
+  except as required for reasonable and customary use in describing the
+  origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+  agreed to in writing, Licensor provides the Work (and each
+  Contributor provides its Contributions) on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+  implied, including, without limitation, any warranties or conditions
+  of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+  PARTICULAR PURPOSE. You are solely responsible for determining the
+  appropriateness of using or redistributing the Work and assume any
+  risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+  whether in tort (including negligence), contract, or otherwise,
+  unless required by applicable law (such as deliberate and grossly
+  negligent acts) or agreed to in writing, shall any Contributor be
+  liable to You for damages, including any direct, indirect, special,
+  incidental, or consequential damages of any character arising as a
+  result of this License or out of the use or inability to use the
+  Work (including but not limited to damages for loss of goodwill,
+  work stoppage, computer failure or malfunction, or any and all
+  other commercial damages or losses), even if such Contributor
+  has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+  the Work or Derivative Works thereof, You may choose to offer,
+  and charge a fee for, acceptance of support, warranty, indemnity,
+  or other liability obligations and/or rights consistent with this
+  License. However, in accepting such obligations, You may act only
+  on Your own behalf and on Your sole responsibility, not on behalf
+  of any other Contributor, and only if You agree to indemnify,
+  defend, and hold each Contributor harmless for any liability
+  incurred by, or claims asserted against, such Contributor by reason
+  of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+  To apply the Apache License to your work, attach the following
+  boilerplate notice, with the fields enclosed by brackets "[]"
+  replaced with your own identifying information. (Don't include
+  the brackets!)  The text should be enclosed in the appropriate
+  comment syntax for the file format. We also recommend that a
+  file or class name and description of purpose be included on the
+  same "printed page" as the copyright notice for easier
+  identification within third-party archives.
+
+Copyright [yyyy] [name of copyright owner]
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/abstract/Array.d.ts

@@ -10,6 +10,8 @@ import type { AnyJson, Codec, Inspect, IU8a, IVec, Registry } from '../types';
 export declare abstract class AbstractArray<T extends Codec> extends Array<T> implements IVec<T> {
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     /**
      * @description This ensures that operators such as clice, filter, map, etc. return
      * new Array instances (without this we need to apply overrides)

package/abstract/Base.d.ts

@@ -6,9 +6,10 @@ import type { AnyJson, BareOpts, Codec, Inspect, IU8a, Registry } from '../types
  */
 export declare abstract class AbstractBase<T extends Codec> implements Codec {
     #private;
-    createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
     readonly registry: Registry;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     protected constructor(registry: Registry, value: T, initialU8aLength?: number);
     /**
      * @description The length of the value when encoded as a Uint8Array

package/abstract/Base.js

@@ -8,8 +8,8 @@
 export class AbstractBase {
   #raw;
   constructor(registry, value, initialU8aLength) {
-    this.#raw = value;
     this.initialU8aLength = initialU8aLength;
+    this.#raw = value;
     this.registry = registry;
   }
 

package/abstract/Int.d.ts

@@ -11,9 +11,11 @@ export declare const DEFAULT_UINT_BITS = 64;
 export declare abstract class AbstractInt extends BN implements INumber {
     #private;
     readonly registry: Registry;
-    createdAtHash?: IU8a;
     readonly encodedLength: number;
     readonly isUnsigned: boolean;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: AnyNumber, bitLength?: UIntBitLength, isSigned?: boolean);
     /**
      * @description returns a hash of the contents

package/abstract/Int.js

@@ -72,6 +72,7 @@ export class AbstractInt extends BN {
     this.registry = registry;
     this.#bitLength = bitLength;
     this.encodedLength = this.#bitLength / 8;
+    this.initialU8aLength = this.#bitLength / 8;
     this.isUnsigned = !isSigned;
     const isNegative = this.isNeg();
     const maxBits = bitLength - (isSigned && !isNegative ? 1 : 0);

package/base/Compact.d.ts

@@ -18,7 +18,8 @@ export declare class Compact<T extends INumber> implements ICompact<T> {
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, Type: CodecClass<T> | string, value?: Compact<T> | AnyNumber, { definition, setDefinition }?: Options<T>);
     static with<O extends INumber>(Type: CodecClass<O> | string): CodecClass<Compact<O>>;
     /**

package/base/DoNotConstruct.d.ts

@@ -9,6 +9,7 @@ export declare class DoNotConstruct implements Codec {
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, typeName?: string);
     static with(typeName?: string): CodecClass;
     /**

package/base/Enum.d.ts

@@ -27,7 +27,8 @@ export declare class Enum implements IEnum {
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, Types: Record<string, string | CodecClass> | Record<string, number> | string[], value?: unknown, index?: number, { definition, setDefinition }?: Options);
     static with(Types: Record<string, string | CodecClass> | Record<string, number> | string[]): EnumCodecClass<Enum>;
     /**

package/base/Null.d.ts

@@ -10,7 +10,8 @@ export declare class Null implements Codec {
     readonly isEmpty = true;
     readonly registry: Registry;
     createdAtHash?: IU8a;
-    readonly initialU8aLength = 0;
+    initialU8aLength: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry);
     /**
      * @description returns a hash of the contents

package/base/Null.js

@@ -11,7 +11,6 @@ import { isNull } from '@polkadot/util';
 export class Null {
   encodedLength = 0;
   isEmpty = true;
-  // Added for compatibility reasons, e.g. see Option
   initialU8aLength = 0;
   constructor(registry) {
     this.registry = registry;

package/base/Option.d.ts

@@ -17,6 +17,7 @@ export declare class Option<T extends Codec> implements IOption<T> {
     readonly registry: Registry;
     createdAtHash?: IU8a;
     initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, typeName: CodecClass<T> | string, value?: unknown, { definition, setDefinition }?: Options<T>);
     static with<O extends Codec>(Type: CodecClass<O> | string): CodecClass<Option<O>>;
     /**

package/base/Option.js

@@ -63,7 +63,7 @@ export class Option {
     this.registry = registry;
     this.#Type = Type;
     this.#raw = decoded;
-    if (decoded && decoded.initialU8aLength) {
+    if (decoded != null && decoded.initialU8aLength) {
       this.initialU8aLength = 1 + decoded.initialU8aLength;
     }
   }

package/base/Tuple.d.ts

@@ -17,7 +17,6 @@ interface Options {
  */
 export declare class Tuple extends AbstractArray<Codec> implements ITuple<Codec[]> {
     #private;
-    readonly initialU8aLength?: number;
     constructor(registry: Registry, Types: TupleTypes | TupleType, value?: AnyTupleValue, { definition, setDefinition }?: Options);
     static with(Types: TupleTypes | TupleType): CodecClass<Tuple>;
     /**

package/base/Tuple.js

@@ -10,19 +10,27 @@ function noopSetDefinition(d) {
 
 /** @internal */
 function decodeTuple(registry, result, value, Classes) {
-  if (isU8a(value) || isHex(value)) {
+  if (Array.isArray(value)) {
+    const Types = Classes[0];
+    for (let i = 0; i < Types.length; i++) {
+      try {
+        const entry = value == null ? void 0 : value[i];
+        result[i] = entry instanceof Types[i] ? entry : new Types[i](registry, entry);
+      } catch (error) {
+        throw new Error(`Tuple: failed on ${i}:: ${error.message}`);
+      }
+    }
+    return [result, 0];
+  } else if (isHex(value)) {
     return decodeU8a(registry, result, u8aToU8a(value), Classes);
-  }
-  const Types = Classes[0];
-  for (let i = 0; i < Types.length; i++) {
-    try {
-      const entry = value == null ? void 0 : value[i];
-      result[i] = entry instanceof Types[i] ? entry : new Types[i](registry, entry);
-    } catch (error) {
-      throw new Error(`Tuple: failed on ${i}:: ${error.message}`);
+  } else if (!value || !result.length) {
+    const Types = Classes[0];
+    for (let i = 0; i < Types.length; i++) {
+      result[i] = new Types[i](registry);
     }
+    return [result, 0];
   }
-  return [result, 0];
+  throw new Error(`Expected array input to Tuple decoding, found ${typeof value}: ${stringify(value)}`);
 }
 
 /**

package/base/Vec.d.ts

@@ -5,7 +5,7 @@ interface Options<T> {
     definition?: CodecClass<T>;
     setDefinition?: (d: CodecClass<T>) => CodecClass<T>;
 }
-export declare function decodeVec<T extends Codec>(registry: Registry, result: T[], value: Uint8Array | HexString | unknown[], startAt: number, Type: CodecClass<T>): [number, number];
+export declare function decodeVec<T extends Codec>(registry: Registry, result: T[], value: Uint8Array | HexString | unknown[] | null, startAt: number, Type: CodecClass<T>): [number, number];
 /**
  * @name Vec
  * @description
@@ -15,7 +15,6 @@ export declare function decodeVec<T extends Codec>(registry: Registry, result: T
  */
 export declare class Vec<T extends Codec> extends AbstractArray<T> {
     #private;
-    readonly initialU8aLength?: number;
     constructor(registry: Registry, Type: CodecClass<T> | string, value?: Uint8Array | HexString | unknown[], { definition, setDefinition }?: Options<T>);
     static with<O extends Codec>(Type: CodecClass<O> | string): CodecClass<Vec<O>>;
     /**

package/base/Vec.js

@@ -1,7 +1,7 @@
 // Copyright 2017-2023 @polkadot/types-codec authors & contributors
 // SPDX-License-Identifier: Apache-2.0
 
-import { compactFromU8aLim, isU8a, logger, u8aToU8a } from '@polkadot/util';
+import { compactFromU8aLim, isHex, isU8a, logger, stringify, u8aToU8a } from '@polkadot/util';
 import { AbstractArray } from "../abstract/Array.js";
 import { decodeU8aVec, typeToConstructor } from "../utils/index.js";
 const MAX_LENGTH = 64 * 1024;
@@ -12,13 +12,17 @@ function noopSetDefinition(d) {
 function decodeVecLength(value) {
   if (Array.isArray(value)) {
     return [value, value.length, 0];
+  } else if (isU8a(value) || isHex(value)) {
+    const u8a = u8aToU8a(value);
+    const [startAt, length] = compactFromU8aLim(u8a);
+    if (length > MAX_LENGTH) {
+      throw new Error(`Vec length ${length.toString()} exceeds ${MAX_LENGTH}`);
+    }
+    return [u8a, length, startAt];
+  } else if (!value) {
+    return [null, 0, 0];
   }
-  const u8a = u8aToU8a(value);
-  const [startAt, length] = compactFromU8aLim(u8a);
-  if (length > MAX_LENGTH) {
-    throw new Error(`Vec length ${length.toString()} exceeds ${MAX_LENGTH}`);
-  }
-  return [u8a, length, startAt];
+  throw new Error(`Expected array/hex input to Vec<*> decoding, found ${typeof value}: ${stringify(value)}`);
 }
 export function decodeVec(registry, result, value, startAt, Type) {
   if (Array.isArray(value)) {
@@ -35,7 +39,11 @@ export function decodeVec(registry, result, value, startAt, Type) {
       }
     }
     return [0, 0];
+  } else if (!value) {
+    return [0, 0];
   }
+
+  // we don't need more checks, we already limited it via the length decoding
   return decodeU8aVec(registry, result, u8aToU8a(value), startAt, Type);
 }
 
@@ -55,7 +63,12 @@ export class Vec extends AbstractArray {
     const [decodeFrom, length, startAt] = decodeVecLength(value);
     super(registry, length);
     this.#Type = definition || setDefinition(typeToConstructor(registry, Type));
-    this.initialU8aLength = (isU8a(decodeFrom) ? decodeU8aVec(registry, this, decodeFrom, startAt, this.#Type) : decodeVec(registry, this, decodeFrom, startAt, this.#Type))[0];
+    try {
+      this.initialU8aLength = (isU8a(decodeFrom) ? decodeU8aVec(registry, this, decodeFrom, startAt, this.#Type) : decodeVec(registry, this, decodeFrom, startAt, this.#Type))[0];
+    } catch (e) {
+      console.error(decodeFrom, length, startAt);
+      throw e;
+    }
   }
   static with(Type) {
     let definition;

package/base/VecFixed.d.ts

@@ -12,7 +12,6 @@ interface Options<T> {
  */
 export declare class VecFixed<T extends Codec> extends AbstractArray<T> {
     #private;
-    readonly initialU8aLength?: number;
     constructor(registry: Registry, Type: CodecClass<T> | string, length: number, value?: Uint8Array | HexString | unknown[], { definition, setDefinition }?: Options<T>);
     static with<O extends Codec>(Type: CodecClass<O> | string, length: number): CodecClass<VecFixed<O>>;
     /**

package/cjs/abstract/Base.js

@@ -14,8 +14,8 @@ exports.AbstractBase = void 0;
 class AbstractBase {
   #raw;
   constructor(registry, value, initialU8aLength) {
-    this.#raw = value;
     this.initialU8aLength = initialU8aLength;
+    this.#raw = value;
     this.registry = registry;
   }
 

package/cjs/abstract/Int.js

@@ -82,6 +82,7 @@ class AbstractInt extends _util.BN {
     this.registry = registry;
     this.#bitLength = bitLength;
     this.encodedLength = this.#bitLength / 8;
+    this.initialU8aLength = this.#bitLength / 8;
     this.isUnsigned = !isSigned;
     const isNegative = this.isNeg();
     const maxBits = bitLength - (isSigned && !isNegative ? 1 : 0);

package/cjs/base/Null.js

@@ -16,7 +16,6 @@ var _util = require("@polkadot/util");
 class Null {
   encodedLength = 0;
   isEmpty = true;
-  // Added for compatibility reasons, e.g. see Option
   initialU8aLength = 0;
   constructor(registry) {
     this.registry = registry;

package/cjs/base/Option.js

@@ -70,7 +70,7 @@ class Option {
     this.registry = registry;
     this.#Type = Type;
     this.#raw = decoded;
-    if (decoded && decoded.initialU8aLength) {
+    if (decoded != null && decoded.initialU8aLength) {
       this.initialU8aLength = 1 + decoded.initialU8aLength;
     }
   }

package/cjs/base/Tuple.js

@@ -16,19 +16,27 @@ function noopSetDefinition(d) {
 
 /** @internal */
 function decodeTuple(registry, result, value, Classes) {
-  if ((0, _util.isU8a)(value) || (0, _util.isHex)(value)) {
+  if (Array.isArray(value)) {
+    const Types = Classes[0];
+    for (let i = 0; i < Types.length; i++) {
+      try {
+        const entry = value == null ? void 0 : value[i];
+        result[i] = entry instanceof Types[i] ? entry : new Types[i](registry, entry);
+      } catch (error) {
+        throw new Error(`Tuple: failed on ${i}:: ${error.message}`);
+      }
+    }
+    return [result, 0];
+  } else if ((0, _util.isHex)(value)) {
     return (0, _utils.decodeU8a)(registry, result, (0, _util.u8aToU8a)(value), Classes);
-  }
-  const Types = Classes[0];
-  for (let i = 0; i < Types.length; i++) {
-    try {
-      const entry = value == null ? void 0 : value[i];
-      result[i] = entry instanceof Types[i] ? entry : new Types[i](registry, entry);
-    } catch (error) {
-      throw new Error(`Tuple: failed on ${i}:: ${error.message}`);
+  } else if (!value || !result.length) {
+    const Types = Classes[0];
+    for (let i = 0; i < Types.length; i++) {
+      result[i] = new Types[i](registry);
     }
+    return [result, 0];
   }
-  return [result, 0];
+  throw new Error(`Expected array input to Tuple decoding, found ${typeof value}: ${(0, _util.stringify)(value)}`);
 }
 
 /**

package/cjs/base/Vec.js

@@ -19,13 +19,17 @@ function noopSetDefinition(d) {
 function decodeVecLength(value) {
   if (Array.isArray(value)) {
     return [value, value.length, 0];
+  } else if ((0, _util.isU8a)(value) || (0, _util.isHex)(value)) {
+    const u8a = (0, _util.u8aToU8a)(value);
+    const [startAt, length] = (0, _util.compactFromU8aLim)(u8a);
+    if (length > MAX_LENGTH) {
+      throw new Error(`Vec length ${length.toString()} exceeds ${MAX_LENGTH}`);
+    }
+    return [u8a, length, startAt];
+  } else if (!value) {
+    return [null, 0, 0];
   }
-  const u8a = (0, _util.u8aToU8a)(value);
-  const [startAt, length] = (0, _util.compactFromU8aLim)(u8a);
-  if (length > MAX_LENGTH) {
-    throw new Error(`Vec length ${length.toString()} exceeds ${MAX_LENGTH}`);
-  }
-  return [u8a, length, startAt];
+  throw new Error(`Expected array/hex input to Vec<*> decoding, found ${typeof value}: ${(0, _util.stringify)(value)}`);
 }
 function decodeVec(registry, result, value, startAt, Type) {
   if (Array.isArray(value)) {
@@ -42,7 +46,11 @@ function decodeVec(registry, result, value, startAt, Type) {
       }
     }
     return [0, 0];
+  } else if (!value) {
+    return [0, 0];
   }
+
+  // we don't need more checks, we already limited it via the length decoding
   return (0, _utils.decodeU8aVec)(registry, result, (0, _util.u8aToU8a)(value), startAt, Type);
 }
 
@@ -64,7 +72,12 @@ class Vec extends _Array.AbstractArray {
     const [decodeFrom, length, startAt] = decodeVecLength(value);
     super(registry, length);
     this.#Type = definition || setDefinition((0, _utils.typeToConstructor)(registry, Type));
-    this.initialU8aLength = ((0, _util.isU8a)(decodeFrom) ? (0, _utils.decodeU8aVec)(registry, this, decodeFrom, startAt, this.#Type) : decodeVec(registry, this, decodeFrom, startAt, this.#Type))[0];
+    try {
+      this.initialU8aLength = ((0, _util.isU8a)(decodeFrom) ? (0, _utils.decodeU8aVec)(registry, this, decodeFrom, startAt, this.#Type) : decodeVec(registry, this, decodeFrom, startAt, this.#Type))[0];
+    } catch (e) {
+      console.error(decodeFrom, length, startAt);
+      throw e;
+    }
   }
   static with(Type) {
     let definition;

package/cjs/native/Bool.js

@@ -15,6 +15,7 @@ var _util = require("@polkadot/util");
  * @noInheritDoc
  */
 class bool extends Boolean {
+  initialU8aLength = 1;
   constructor(registry) {
     let value = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
     super((0, _util.isU8a)(value) ? value[0] === 1 : value instanceof Boolean ? value.valueOf() : !!value);

package/cjs/native/Date.js

@@ -35,6 +35,7 @@ function decodeDate(value) {
  * @noInheritDoc
  */
 class CodecDate extends Date {
+  initialU8aLength = BITLENGTH / 8;
   constructor(registry) {
     let value = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
     super(decodeDate(value));

package/cjs/native/Struct.js

@@ -222,7 +222,7 @@ class Struct extends Map {
   toHuman(isExtended) {
     const json = {};
     for (const [k, v] of this.entries()) {
-      json[k] = v && v.toHuman(isExtended);
+      json[k] = v.toHuman(isExtended);
     }
     return json;
   }
@@ -233,11 +233,9 @@ class Struct extends Map {
   toJSON() {
     const json = {};
     for (const [k, v] of this.entries()) {
-      const jsonKey = this.#jsonMap.get(k) || k;
-
-      // We actually log inside the U8a decoding and use JSON.stringify(...), which
-      // means that the Vec may be partially populated (same applies to toHuman, same check)
-      json[jsonKey] = v && v.toJSON();
+      // Here we pull out the entry against the JSON mapping (if supplied)
+      // since this representation goes over RPC and needs to be correct
+      json[this.#jsonMap.get(k) || k] = v.toJSON();
     }
     return json;
   }
@@ -248,11 +246,7 @@ class Struct extends Map {
   toPrimitive() {
     const json = {};
     for (const [k, v] of this.entries()) {
-      const jsonKey = this.#jsonMap.get(k) || k;
-
-      // We actually log inside the U8a decoding and use JSON.stringify(...), which
-      // means that the Vec may be partially populated (same applies to toHuman, same check)
-      json[jsonKey] = v && v.toPrimitive();
+      json[k] = v.toPrimitive();
     }
     return json;
   }
@@ -278,9 +272,7 @@ class Struct extends Map {
   toU8a(isBare) {
     const encoded = [];
     for (const [k, v] of this.entries()) {
-      if (v && (0, _util.isFunction)(v.toU8a)) {
-        encoded.push(v.toU8a(!isBare || (0, _util.isBoolean)(isBare) ? isBare : isBare[k]));
-      }
+      encoded.push(v.toU8a(!isBare || (0, _util.isBoolean)(isBare) ? isBare : isBare[k]));
     }
     return (0, _util.u8aConcatStrict)(encoded);
   }

package/cjs/packageInfo.js

@@ -13,6 +13,6 @@ const packageInfo = {
   name: '@polkadot/types-codec',
   path: typeof __dirname === 'string' ? __dirname : 'auto',
   type: 'cjs',
-  version: '9.11.2'
+  version: '9.12.1'
 };
 exports.packageInfo = packageInfo;

package/extended/BTreeSet.d.ts

@@ -4,7 +4,8 @@ export declare class BTreeSet<V extends Codec = Codec> extends Set<V> implements
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, valType: CodecClass<V> | string, rawValue?: Uint8Array | string | string[] | Set<any>);
     static with<V extends Codec>(valType: CodecClass<V> | string): CodecClass<BTreeSet<V>>;
     /**

package/extended/Map.d.ts

@@ -4,7 +4,8 @@ export declare class CodecMap<K extends Codec = Codec, V extends Codec = Codec>
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, keyType: CodecClass<K> | string, valType: CodecClass<V> | string, rawValue: Uint8Array | string | Map<any, any> | undefined, type?: 'BTreeMap' | 'HashMap');
     /**
      * @description The length of the value when encoded as a Uint8Array

package/native/Bool.d.ts

@@ -9,6 +9,8 @@ import type { AnyBool, Codec, Inspect, IU8a, Registry } from '../types';
 export declare class bool extends Boolean implements Codec {
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    initialU8aLength: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: bool | AnyBool | Uint8Array | number);
     /**
      * @description The length of the value when encoded as a Uint8Array

package/native/Bool.js

@@ -10,6 +10,7 @@ import { isU8a, u8aToHex } from '@polkadot/util';
  * @noInheritDoc
  */
 export class bool extends Boolean {
+  initialU8aLength = 1;
   constructor(registry, value = false) {
     super(isU8a(value) ? value[0] === 1 : value instanceof Boolean ? value.valueOf() : !!value);
     this.registry = registry;

package/native/Date.d.ts

@@ -15,6 +15,8 @@ import { BN } from '@polkadot/util';
 export declare class CodecDate extends Date implements INumber {
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    initialU8aLength: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: CodecDate | Date | AnyNumber);
     /**
      * @description The length of the value when encoded as a Uint8Array

package/native/Date.js

@@ -29,6 +29,7 @@ function decodeDate(value) {
  * @noInheritDoc
  */
 export class CodecDate extends Date {
+  initialU8aLength = BITLENGTH / 8;
   constructor(registry, value = 0) {
     super(decodeDate(value));
     this.registry = registry;

package/native/Float.d.ts

@@ -13,10 +13,11 @@ interface Options {
  */
 export declare class Float extends Number implements IFloat {
     #private;
-    createdAtHash?: IU8a;
     readonly encodedLength: number;
-    readonly initialU8aLength?: number;
     readonly registry: Registry;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: AnyFloat, { bitLength }?: Options);
     static with(bitLength: 32 | 64): CodecClass<Float>;
     /**

package/native/Json.d.ts

@@ -11,6 +11,8 @@ import type { AnyJson, Codec, Inspect, IU8a, Registry } from '../types';
 export declare class Json extends Map<string, any> implements Codec {
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: Record<string, unknown> | null);
     /**
      * @description Always 0, never encodes as a Uint8Array

package/native/Raw.d.ts

@@ -10,9 +10,10 @@ import type { AnyJson, AnyU8a, Inspect, IU8a, Registry } from '../types';
  * @noInheritDoc
  */
 export declare class Raw extends Uint8Array implements IU8a {
-    createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
     readonly registry: Registry;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     /**
      * @description This ensures that operators such as clice, filter, map, etc. return
      * new Array instances (without this we need to apply overrides)

package/native/Set.d.ts

@@ -13,6 +13,8 @@ export declare class CodecSet extends Set<string> implements ISet<string> {
     #private;
     readonly registry: Registry;
     createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, setValues: SetValues, value?: string[] | Set<string> | Uint8Array | BN | number | string, bitLength?: number);
     static with(values: SetValues, bitLength?: number): CodecClass<CodecSet>;
     /**

package/native/Struct.d.ts

@@ -26,9 +26,10 @@ export declare class Struct<S extends TypesDef = TypesDef, V extends {
     [K in keyof S]: string;
 }> extends Map<keyof S, Codec> implements IStruct<keyof S> {
     #private;
-    createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
     readonly registry: Registry;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, Types: S, value?: V | Map<unknown, unknown> | unknown[] | HexString | null, jsonMap?: Map<string, string>, { definition, setDefinition }?: Options);
     static with<S extends TypesDef>(Types: S, jsonMap?: Map<string, string>): CodecClass<Struct<S>>;
     /**

package/native/Struct.js

@@ -1,7 +1,7 @@
 // Copyright 2017-2023 @polkadot/types-codec authors & contributors
 // SPDX-License-Identifier: Apache-2.0
 
-import { isBoolean, isFunction, isHex, isObject, isU8a, isUndefined, objectProperties, stringCamelCase, stringify, u8aConcatStrict, u8aToHex, u8aToU8a } from '@polkadot/util';
+import { isBoolean, isHex, isObject, isU8a, isUndefined, objectProperties, stringCamelCase, stringify, u8aConcatStrict, u8aToHex, u8aToU8a } from '@polkadot/util';
 import { compareMap, decodeU8aStruct, mapToTypeMap, typesToMap } from "../utils/index.js";
 function noopSetDefinition(d) {
   return d;
@@ -213,7 +213,7 @@ export class Struct extends Map {
   toHuman(isExtended) {
     const json = {};
     for (const [k, v] of this.entries()) {
-      json[k] = v && v.toHuman(isExtended);
+      json[k] = v.toHuman(isExtended);
     }
     return json;
   }
@@ -224,11 +224,9 @@ export class Struct extends Map {
   toJSON() {
     const json = {};
     for (const [k, v] of this.entries()) {
-      const jsonKey = this.#jsonMap.get(k) || k;
-
-      // We actually log inside the U8a decoding and use JSON.stringify(...), which
-      // means that the Vec may be partially populated (same applies to toHuman, same check)
-      json[jsonKey] = v && v.toJSON();
+      // Here we pull out the entry against the JSON mapping (if supplied)
+      // since this representation goes over RPC and needs to be correct
+      json[this.#jsonMap.get(k) || k] = v.toJSON();
     }
     return json;
   }
@@ -239,11 +237,7 @@ export class Struct extends Map {
   toPrimitive() {
     const json = {};
     for (const [k, v] of this.entries()) {
-      const jsonKey = this.#jsonMap.get(k) || k;
-
-      // We actually log inside the U8a decoding and use JSON.stringify(...), which
-      // means that the Vec may be partially populated (same applies to toHuman, same check)
-      json[jsonKey] = v && v.toPrimitive();
+      json[k] = v.toPrimitive();
     }
     return json;
   }
@@ -269,9 +263,7 @@ export class Struct extends Map {
   toU8a(isBare) {
     const encoded = [];
     for (const [k, v] of this.entries()) {
-      if (v && isFunction(v.toU8a)) {
-        encoded.push(v.toU8a(!isBare || isBoolean(isBare) ? isBare : isBare[k]));
-      }
+      encoded.push(v.toU8a(!isBare || isBoolean(isBare) ? isBare : isBare[k]));
     }
     return u8aConcatStrict(encoded);
   }

package/native/Text.d.ts

@@ -10,9 +10,10 @@ import type { AnyString, AnyU8a, Inspect, IText, IU8a, Registry } from '../types
  */
 export declare class Text extends String implements IText {
     #private;
-    createdAtHash?: IU8a;
-    readonly initialU8aLength?: number;
     readonly registry: Registry;
+    createdAtHash?: IU8a;
+    initialU8aLength?: number;
+    isStorageFallback?: boolean;
     constructor(registry: Registry, value?: null | AnyString | AnyU8a | {
         toString: () => string;
     });

package/package.json

@@ -20,7 +20,7 @@
     "./cjs/detectPackage.js"
   ],
   "type": "module",
-  "version": "9.11.2",
+  "version": "9.12.1",
   "main": "./cjs/index.js",
   "module": "./index.js",
   "types": "./index.d.ts",
@@ -434,8 +434,8 @@
     }
   },
   "dependencies": {
-    "@babel/runtime": "^7.20.7",
-    "@polkadot/util": "^10.2.4",
-    "@polkadot/x-bigint": "^10.2.4"
+    "@babel/runtime": "^7.20.13",
+    "@polkadot/util": "^10.2.6",
+    "@polkadot/x-bigint": "^10.2.6"
   }
 }

package/packageInfo.js

@@ -7,5 +7,5 @@ export const packageInfo = {
   name: '@polkadot/types-codec',
   path: (import.meta && import.meta.url) ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf('/') + 1) : 'auto',
   type: 'esm',
-  version: '9.11.2'
+  version: '9.12.1'
 };

package/types/codec.d.ts

@@ -11,11 +11,35 @@ export interface Inspect {
 /**
  * @name Codec
  * @description
- * The base Codec interface. All types implement the interface provided here. Additionally
- * implementors can add their own specific interfaces and helpers with getters and functions.
- * The Codec Base is however required for operating as an encoding/decoding layer
+ * The base Codec interface. All types implement the interface provided here.
+ * Additionally implementors can add their own specific interfaces and helpers
+ * with getters and functions. The Codec Base is however required for operating
+ * as an encoding/decoding layer
  */
 export interface Codec {
+    /**
+     * @description
+     * The block at which this value was retrieved/created (set to non-empty when
+     * retrieved from storage)
+     */
+    createdAtHash?: IU8a;
+    /**
+     * @description
+     * The length of the initial encoded value (Only available when the value was
+     * constructed from a Uint8Array input)
+     */
+    initialU8aLength?: number;
+    /**
+     * @description
+     * (internal usage) Indicates that the value was created via a fallback. This
+     * is used when with data specified in the metadata when the storage entry is
+     * empty.
+     *
+     * With metadata fallback values (available as defaults on most storage entries)
+     * any empty storage item should erturn the default. (This is the same as the
+     * implementation on the Substrate runtime)
+     */
+    isStorageFallback?: boolean;
     /**
      * @description The length of the value when encoded as a Uint8Array
      */
@@ -24,10 +48,6 @@ export interface Codec {
      * @description Returns a hash of the value
      */
     readonly hash: IU8a;
-    /**
-     * @description The length of the initial encoded value (Only available when constructed from a Uint8Array)
-     */
-    readonly initialU8aLength?: number;
     /**
      * @description Checks if the value is an empty value
      */
@@ -36,10 +56,6 @@ export interface Codec {
      * @description The registry associated with this object
      */
     readonly registry: Registry;
-    /**
-     * @description The block at which this value was retrieved/created (set to non-empty when retrieved from storage)
-     */
-    createdAtHash?: IU8a;
     /**
      * @description Compares the value of the input to see if there is a match
      */

package/types/helpers.d.ts

@@ -1,5 +1,6 @@
 /// <reference types="bn.js" />
 import type { BN } from '@polkadot/util';
+import type { HexString } from '@polkadot/util/types';
 import type { Codec } from './codec';
 export type AnyJson = string | number | boolean | null | undefined | AnyJson[] | {
     [index: string]: AnyJson;
@@ -13,4 +14,4 @@ export type AnyTuple = Codec[];
 export type AnyU8a = Uint8Array | number[] | string;
 export type UIntBitLength = 8 | 16 | 32 | 64 | 128 | 256;
 export type U8aBitLength = 8 | 16 | 32 | 64 | 128 | 160 | 256 | 264 | 512 | 520 | 1024 | 2048;
-export type AnyTupleValue = AnyU8a | (Codec | AnyU8a | AnyNumber | AnyString | undefined | null)[];
+export type AnyTupleValue = Exclude<AnyU8a, string> | HexString | (Codec | AnyU8a | AnyNumber | AnyString | undefined | null)[];

package/types/registry.d.ts

@@ -19,6 +19,7 @@ export type RegistryTypes = Record<string, CodecClass | string | Record<string,
 }>;
 export interface CodecCreateOptions {
     blockHash?: Uint8Array | string | null;
+    isFallback?: boolean;
     isOptional?: boolean;
     isPedantic?: boolean;
 }