@dedot/chaintypes 0.0.1-next.f5bf4fc2.1 → 0.1.0

package/polkadot/consts.d.ts

@@ -1,7 +1,7 @@
-// Generated by @dedot/codegen
+// Generated by dedot cli
 
-import type { GenericChainConsts } from '@dedot/types';
-import type { RuntimeVersion, Permill, Bytes, Perbill } from '@dedot/codecs';
+import type { GenericChainConsts, RpcVersion } from 'dedot/types';
+import type { RuntimeVersion, Permill, Bytes, Perbill } from 'dedot/codecs';
 import type {
   FrameSystemLimitsBlockWeights,
   FrameSystemLimitsBlockLength,
@@ -11,7 +11,7 @@ import type {
   PalletReferendaTrackInfo,
 } from './types';
 
-export interface ChainConsts extends GenericChainConsts {
+export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<Rv> {
   /**
    * Pallet `System`'s constants
    **/
@@ -182,11 +182,6 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     maxReserves: number;
 
-    /**
-     * The maximum number of holds that can exist on an account at any time.
-     **/
-    maxHolds: number;
-
     /**
      * The maximum number of individual freeze locks that can exist on an account at any time.
      **/
@@ -202,10 +197,10 @@ export interface ChainConsts extends GenericChainConsts {
    **/
   transactionPayment: {
     /**
-     * A fee mulitplier for `Operational` extrinsics to compute "virtual tip" to boost their
+     * A fee multiplier for `Operational` extrinsics to compute "virtual tip" to boost their
      * `priority`
      *
-     * This value is multipled by the `final_fee` to obtain a "virtual tip" that is later
+     * This value is multiplied by the `final_fee` to obtain a "virtual tip" that is later
      * added to a tip component in regular `priority` calculations.
      * It means that a `Normal` transaction can front-run a similarly-sized `Operational`
      * extrinsic (with no tip), by including a tip value greater than the virtual tip.
@@ -250,8 +245,8 @@ export interface ChainConsts extends GenericChainConsts {
      * Following information is kept for eras in `[current_era -
      * HistoryDepth, current_era]`: `ErasStakers`, `ErasStakersClipped`,
      * `ErasValidatorPrefs`, `ErasValidatorReward`, `ErasRewardPoints`,
-     * `ErasTotalStake`, `ErasStartSessionIndex`,
-     * `StakingLedger.claimed_rewards`.
+     * `ErasTotalStake`, `ErasStartSessionIndex`, `ClaimedRewards`, `ErasStakersPaged`,
+     * `ErasStakersOverview`.
      *
      * Must be more than the number of eras delayed by session.
      * I.e. active era must always be in history. I.e. `active_era >
@@ -261,7 +256,7 @@ export interface ChainConsts extends GenericChainConsts {
      * this should be set to same value or greater as in storage.
      *
      * Note: `HistoryDepth` is used as the upper bound for the `BoundedVec`
-     * item `StakingLedger.claimed_rewards`. Setting this value lower than
+     * item `StakingLedger.legacy_claimed_rewards`. Setting this value lower than
      * the existing value can lead to inconsistencies in the
      * `StakingLedger` and will need to be handled properly in a migration.
      * The test `reducing_history_depth_abrupt` shows this effect.
@@ -287,12 +282,19 @@ export interface ChainConsts extends GenericChainConsts {
     slashDeferDuration: number;
 
     /**
-     * The maximum number of nominators rewarded for each validator.
+     * The maximum size of each `T::ExposurePage`.
+     *
+     * An `ExposurePage` is weakly bounded to a maximum of `MaxExposurePageSize`
+     * nominators.
+     *
+     * For older non-paged exposure, a reward payout was restricted to the top
+     * `MaxExposurePageSize` nominators. This is to limit the i/o cost for the
+     * nominator payout.
      *
-     * For each validator only the `$MaxNominatorRewardedPerValidator` biggest stakers can
-     * claim their reward. This used to limit the i/o cost for the nominator payout.
+     * Note: `MaxExposurePageSize` is used to bound `ClaimedRewards` and is unsafe to reduce
+     * without handling it in a migration.
      **/
-    maxNominatorRewardedPerValidator: number;
+    maxExposurePageSize: number;
 
     /**
      * The maximum number of `unlocking` chunks a [`StakingLedger`] can
@@ -369,23 +371,6 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     [name: string]: any;
   };
-  /**
-   * Pallet `ImOnline`'s constants
-   **/
-  imOnline: {
-    /**
-     * A configuration for base priority of unsigned transactions.
-     *
-     * This is exposed so that it can be tuned for particular runtime, when
-     * multiple pallets send unsigned transactions.
-     **/
-    unsignedPriority: bigint;
-
-    /**
-     * Generic pallet constant
-     **/
-    [name: string]: any;
-  };
   /**
    * Pallet `AuthorityDiscovery`'s constants
    **/
@@ -509,6 +494,15 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Origins`'s constants
+   **/
+  origins: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `Whitelist`'s constants
    **/
@@ -563,14 +557,14 @@ export interface ChainConsts extends GenericChainConsts {
    **/
   identity: {
     /**
-     * The amount held on deposit for a registered identity
+     * The amount held on deposit for a registered identity.
      **/
     basicDeposit: bigint;
 
     /**
-     * The amount held on deposit per additional field for a registered identity.
+     * The amount held on deposit per encoded byte for a registered identity.
      **/
-    fieldDeposit: bigint;
+    byteDeposit: bigint;
 
     /**
      * The amount held on deposit for a registered subaccount. This should account for the fact
@@ -584,18 +578,27 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     maxSubAccounts: number;
 
-    /**
-     * Maximum number of additional fields that may be stored in an ID. Needed to bound the I/O
-     * required to access an identity, but can be pretty high.
-     **/
-    maxAdditionalFields: number;
-
     /**
      * Maxmimum number of registrars allowed in the system. Needed to bound the complexity
      * of, e.g., updating judgements.
      **/
     maxRegistrars: number;
 
+    /**
+     * The number of blocks within which a username grant must be accepted.
+     **/
+    pendingUsernameExpiration: number;
+
+    /**
+     * The maximum length of a suffix.
+     **/
+    maxSuffixLength: number;
+
+    /**
+     * The maximum length of a username, including its suffix and any system-added delimiters.
+     **/
+    maxUsernameLength: number;
+
     /**
      * Generic pallet constant
      **/
@@ -782,12 +785,6 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     betterSignedThreshold: Perbill;
 
-    /**
-     * The minimum amount of improvement to the solution score that defines a solution as
-     * "better" in the Unsigned phase.
-     **/
-    betterUnsignedThreshold: Perbill;
-
     /**
      * The repeat threshold of the offchain worker.
      *
@@ -939,6 +936,11 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     maxPointsToBalance: number;
 
+    /**
+     * The maximum number of simultaneous unbonding chunks that can exist per member.
+     **/
+    maxUnbonding: number;
+
     /**
      * Generic pallet constant
      **/
@@ -1175,6 +1177,40 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `StateTrieMigration`'s constants
+   **/
+  stateTrieMigration: {
+    /**
+     * Maximal number of bytes that a key can have.
+     *
+     * FRAME itself does not limit the key length.
+     * The concrete value must therefore depend on your storage usage.
+     * A [`frame_support::storage::StorageNMap`] for example can have an arbitrary number of
+     * keys which are then hashed and concatenated, resulting in arbitrarily long keys.
+     *
+     * Use the *state migration RPC* to retrieve the length of the longest key in your
+     * storage: <https://github.com/paritytech/substrate/issues/11642>
+     *
+     * The migration will halt with a `Halted` event if this value is too small.
+     * Since there is no real penalty from over-estimating, it is advised to use a large
+     * value. The default is 512 byte.
+     *
+     * Some key lengths for reference:
+     * - [`frame_support::storage::StorageValue`]: 32 byte
+     * - [`frame_support::storage::StorageMap`]: 64 byte
+     * - [`frame_support::storage::StorageDoubleMap`]: 96 byte
+     *
+     * For more info see
+     * <https://www.shawntabrizi.com/blog/substrate/querying-substrate-storage-via-rpc/>
+     **/
+    maxKeyLen: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `XcmPallet`'s constants
    **/
@@ -1274,4 +1310,13 @@ export interface ChainConsts extends GenericChainConsts {
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `IdentityMigrator`'s constants
+   **/
+  identityMigrator: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
 }