@dedot/chaintypes 0.142.0 → 0.143.0

package/paseo-asset-hub/consts.d.ts

@@ -1,16 +1,17 @@
 // Generated by dedot cli
 
 import type { GenericChainConsts, RpcVersion } from 'dedot/types';
-import type { RuntimeVersion, Permill } from 'dedot/codecs';
+import type { RuntimeVersion, Bytes, AccountId32, Permill, Perbill } from 'dedot/codecs';
 import type {
   FrameSystemLimitsBlockWeights,
   FrameSystemLimitsBlockLength,
   SpWeightsRuntimeDbWeight,
   PolkadotParachainPrimitivesPrimitivesId,
   SpWeightsWeightV2Weight,
+  FrameSupportPalletId,
   PalletNftsBitFlagsPalletFeature,
   StagingXcmV4Location,
-  FrameSupportPalletId,
+  PalletReferendaTrackDetails,
 } from './types.js';
 
 export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<Rv> {
@@ -99,6 +100,38 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Preimage`'s constants
+   **/
+  preimage: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `Scheduler`'s constants
+   **/
+  scheduler: {
+    /**
+     * The maximum weight that may be scheduled per block for any dispatchables.
+     **/
+    maximumWeight: SpWeightsWeightV2Weight;
+
+    /**
+     * The maximum number of scheduled calls in the queue for a single block.
+     *
+     * NOTE:
+     * + Dependent pallets' benchmarks might require a higher limit for the setting. Set a
+     * higher limit under `runtime-benchmarks` feature.
+     **/
+    maxScheduledPerBlock: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `Balances`'s constants
    **/
@@ -198,6 +231,17 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Claims`'s constants
+   **/
+  claims: {
+    prefix: Bytes;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `Authorship`'s constants
    **/
@@ -211,6 +255,36 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
    * Pallet `CollatorSelection`'s constants
    **/
   collatorSelection: {
+    /**
+     * Account Identifier from which the internal Pot is generated.
+     **/
+    potId: FrameSupportPalletId;
+
+    /**
+     * Maximum number of candidates that we should have.
+     *
+     * This does not take into account the invulnerables.
+     **/
+    maxCandidates: number;
+
+    /**
+     * Minimum number eligible collators. Should always be greater than zero. This includes
+     * Invulnerable collators. This ensures that there will always be one collator who can
+     * produce a block.
+     **/
+    minEligibleCollators: number;
+
+    /**
+     * Maximum number of invulnerables.
+     **/
+    maxInvulnerables: number;
+    kickThreshold: number;
+
+    /**
+     * Gets this pallet's derived pot account.
+     **/
+    potAccount: AccountId32;
+
     /**
      * Generic pallet constant
      **/
@@ -220,6 +294,11 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
    * Pallet `Session`'s constants
    **/
   session: {
+    /**
+     * The amount to be held when setting keys.
+     **/
+    keyDeposit: bigint;
+
     /**
      * Generic pallet constant
      **/
@@ -294,6 +373,12 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
    * Pallet `PolkadotXcm`'s constants
    **/
   polkadotXcm: {
+    /**
+     * The latest supported version that we advertise. Generally just set it to
+     * `pallet_xcm::CurrentXcmVersion`.
+     **/
+    advertisedXcmVersion: number;
+
     /**
      * Generic pallet constant
      **/
@@ -458,6 +543,20 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Indices`'s constants
+   **/
+  indices: {
+    /**
+     * The deposit needed for reserving an index.
+     **/
+    deposit: bigint;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `Assets`'s constants
    **/
@@ -776,6 +875,224 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Treasury`'s constants
+   **/
+  treasury: {
+    /**
+     * Period between successive spends.
+     **/
+    spendPeriod: number;
+
+    /**
+     * Percentage of spare funds (if any) that are burnt per spend period.
+     **/
+    burn: Permill;
+
+    /**
+     * The treasury's pallet id, used for deriving its sovereign account ID.
+     **/
+    palletId: FrameSupportPalletId;
+
+    /**
+     * DEPRECATED: associated with `spend_local` call and will be removed in May 2025.
+     * Refer to <https://github.com/paritytech/polkadot-sdk/pull/5961> for migration to `spend`.
+     *
+     * The maximum number of approvals that can wait in the spending queue.
+     *
+     * NOTE: This parameter is also used within the Bounties Pallet extension if enabled.
+     **/
+    maxApprovals: number;
+
+    /**
+     * The period during which an approved treasury spend has to be claimed.
+     **/
+    payoutPeriod: number;
+
+    /**
+     * Gets this pallet's derived pot account.
+     **/
+    potAccount: AccountId32;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `ConvictionVoting`'s constants
+   **/
+  convictionVoting: {
+    /**
+     * The maximum number of concurrent votes an account may have.
+     *
+     * Also used to compute weight, an overly large value can lead to extrinsics with large
+     * weight estimation: see `delegate` for instance.
+     **/
+    maxVotes: number;
+
+    /**
+     * The minimum period of vote locking.
+     *
+     * It should be no shorter than enactment period to ensure that in the case of an approval,
+     * those successful voters are locked into the consequences that their votes entail.
+     **/
+    voteLockingPeriod: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `Referenda`'s constants
+   **/
+  referenda: {
+    /**
+     * The minimum amount to be used as a deposit for a public referendum proposal.
+     **/
+    submissionDeposit: bigint;
+
+    /**
+     * Maximum size of the referendum queue for a single track.
+     **/
+    maxQueued: number;
+
+    /**
+     * The number of blocks after submission that a referendum must begin being decided by.
+     * Once this passes, then anyone may cancel the referendum.
+     **/
+    undecidingTimeout: number;
+
+    /**
+     * Quantization level for the referendum wakeup scheduler. A higher number will result in
+     * fewer storage reads/writes needed for smaller voters, but also result in delays to the
+     * automatic referendum status changes. Explicit servicing instructions are unaffected.
+     **/
+    alarmInterval: number;
+
+    /**
+     * A list of tracks.
+     *
+     * Note: if the tracks are dynamic, the value in the static metadata might be inaccurate.
+     **/
+    tracks: Array<[number, PalletReferendaTrackDetails]>;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `Origins`'s constants
+   **/
+  origins: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `Whitelist`'s constants
+   **/
+  whitelist: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `Bounties`'s constants
+   **/
+  bounties: {
+    /**
+     * The amount held on deposit for placing a bounty proposal.
+     **/
+    bountyDepositBase: bigint;
+
+    /**
+     * The delay period for which a bounty beneficiary need to wait before claim the payout.
+     **/
+    bountyDepositPayoutDelay: number;
+
+    /**
+     * The time limit for a curator to act before a bounty expires.
+     *
+     * The period that starts when a curator is approved, during which they must execute or
+     * update the bounty via `extend_bounty_expiry`. If missed, the bounty expires, and the
+     * curator may be slashed. If `BlockNumberFor::MAX`, bounties stay active indefinitely,
+     * removing the need for `extend_bounty_expiry`.
+     **/
+    bountyUpdatePeriod: number;
+
+    /**
+     * The curator deposit is calculated as a percentage of the curator fee.
+     *
+     * This deposit has optional upper and lower bounds with `CuratorDepositMax` and
+     * `CuratorDepositMin`.
+     **/
+    curatorDepositMultiplier: Permill;
+
+    /**
+     * Maximum amount of funds that should be placed in a deposit for making a proposal.
+     **/
+    curatorDepositMax: bigint | undefined;
+
+    /**
+     * Minimum amount of funds that should be placed in a deposit for making a proposal.
+     **/
+    curatorDepositMin: bigint | undefined;
+
+    /**
+     * Minimum value for a bounty.
+     **/
+    bountyValueMinimum: bigint;
+
+    /**
+     * The amount held on deposit per byte within the tip report reason or bounty description.
+     **/
+    dataDepositPerByte: bigint;
+
+    /**
+     * Maximum acceptable reason length.
+     *
+     * Benchmarks depend on this value, be sure to update weights file when changing this value
+     **/
+    maximumReasonLength: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `ChildBounties`'s constants
+   **/
+  childBounties: {
+    /**
+     * Maximum number of child bounties that can be added to a parent bounty.
+     **/
+    maxActiveChildBountyCount: number;
+
+    /**
+     * Minimum value for a child-bounty.
+     **/
+    childBountyValueMinimum: bigint;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `AssetRate`'s constants
+   **/
+  assetRate: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `StateTrieMigration`'s constants
    **/
@@ -810,6 +1127,350 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `Staking`'s constants
+   **/
+  staking: {
+    /**
+     * Number of eras to keep in history.
+     *
+     * Following information is kept for eras in `[current_era -
+     * HistoryDepth, current_era]`: `ErasValidatorPrefs`, `ErasValidatorReward`,
+     * `ErasRewardPoints`, `ErasTotalStake`, `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 >
+     * current_era - history_depth` must be guaranteed.
+     *
+     * If migrating an existing pallet from storage value to config value,
+     * this should be set to same value or greater as in storage.
+     **/
+    historyDepth: number;
+
+    /**
+     * Number of sessions per era, as per the preferences of the **relay chain**.
+     **/
+    sessionsPerEra: number;
+
+    /**
+     * Number of sessions before the end of an era when the election for the next era will
+     * start.
+     *
+     * - This determines how many sessions **before** the last session of the era the staking
+     * election process should begin.
+     * - The value is bounded between **1** (election starts at the beginning of the last
+     * session) and `SessionsPerEra` (election starts at the beginning of the first session
+     * of the era).
+     *
+     * ### Example:
+     * - If `SessionsPerEra = 6` and `PlanningEraOffset = 1`, the election starts at the
+     * beginning of session `6 - 1 = 5`.
+     * - If `PlanningEraOffset = 6`, the election starts at the beginning of session `6 - 6 =
+     * 0`, meaning it starts at the very beginning of the era.
+     **/
+    planningEraOffset: number;
+
+    /**
+     * Number of eras that staked funds must remain bonded for.
+     **/
+    bondingDuration: number;
+
+    /**
+     * Number of eras that slashes are deferred by, after computation.
+     *
+     * This should be less than the bonding duration. Set to 0 if slashes
+     * should be applied immediately, without opportunity for intervention.
+     **/
+    slashDeferDuration: number;
+
+    /**
+     * 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.
+     *
+     * Note: `MaxExposurePageSize` is used to bound `ClaimedRewards` and is unsafe to
+     * reduce without handling it in a migration.
+     **/
+    maxExposurePageSize: number;
+
+    /**
+     * The absolute maximum of winner validators this pallet should return.
+     *
+     * As this pallet supports multi-block election, the set of winner validators *per
+     * election* is bounded by this type.
+     **/
+    maxValidatorSet: number;
+
+    /**
+     * The maximum number of `unlocking` chunks a [`StakingLedger`] can
+     * have. Effectively determines how many unique eras a staker may be
+     * unbonding in.
+     *
+     * Note: `MaxUnlockingChunks` is used as the upper bound for the
+     * `BoundedVec` item `StakingLedger.unlocking`. Setting this value
+     * lower than the existing value can lead to inconsistencies in the
+     * `StakingLedger` and will need to be handled properly in a runtime
+     * migration. The test `reducing_max_unlocking_chunks_abrupt` shows
+     * this effect.
+     **/
+    maxUnlockingChunks: number;
+
+    /**
+     * Maximum number of invulnerable validators.
+     **/
+    maxInvulnerables: number;
+
+    /**
+     * Maximum allowed era duration in milliseconds.
+     *
+     * This provides a defensive upper bound to cap the effective era duration, preventing
+     * excessively long eras from causing runaway inflation (e.g., due to bugs). If the actual
+     * era duration exceeds this value, it will be clamped to this maximum.
+     *
+     * Example: For an ideal era duration of 24 hours (86,400,000 ms),
+     * this can be set to 604,800,000 ms (7 days).
+     **/
+    maxEraDuration: bigint;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `NominationPools`'s constants
+   **/
+  nominationPools: {
+    /**
+     * The nomination pool's pallet id.
+     **/
+    palletId: FrameSupportPalletId;
+
+    /**
+     * The maximum pool points-to-balance ratio that an `open` pool can have.
+     *
+     * This is important in the event slashing takes place and the pool's points-to-balance
+     * ratio becomes disproportional.
+     *
+     * Moreover, this relates to the `RewardCounter` type as well, as the arithmetic operations
+     * are a function of number of points, and by setting this value to e.g. 10, you ensure
+     * that the total number of points in the system are at most 10 times the total_issuance of
+     * the chain, in the absolute worse case.
+     *
+     * For a value of 10, the threshold would be a pool points-to-balance ratio of 10:1.
+     * Such a scenario would also be the equivalent of the pool being 90% slashed.
+     **/
+    maxPointsToBalance: number;
+
+    /**
+     * The maximum number of simultaneous unbonding chunks that can exist per member.
+     **/
+    maxUnbonding: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `VoterList`'s constants
+   **/
+  voterList: {
+    /**
+     * The list of thresholds separating the various bags.
+     *
+     * Ids are separated into unsorted bags according to their score. This specifies the
+     * thresholds separating the bags. An id's bag is the largest bag for which the id's score
+     * is less than or equal to its upper threshold.
+     *
+     * When ids are iterated, higher bags are iterated completely before lower bags. This means
+     * that iteration is _semi-sorted_: ids of higher score tend to come before ids of lower
+     * score, but peer ids within a particular bag are sorted in insertion order.
+     *
+     * # Expressing the constant
+     *
+     * This constant must be sorted in strictly increasing order. Duplicate items are not
+     * permitted.
+     *
+     * There is an implied upper limit of `Score::MAX`; that value does not need to be
+     * specified within the bag. For any two threshold lists, if one ends with
+     * `Score::MAX`, the other one does not, and they are otherwise equal, the two
+     * lists will behave identically.
+     *
+     * # Calculation
+     *
+     * It is recommended to generate the set of thresholds in a geometric series, such that
+     * there exists some constant ratio such that `threshold[k + 1] == (threshold[k] *
+     * constant_ratio).max(threshold[k] + 1)` for all `k`.
+     *
+     * The helpers in the `/utils/frame/generate-bags` module can simplify this calculation.
+     *
+     * # Examples
+     *
+     * - If `BagThresholds::get().is_empty()`, then all ids are put into the same bag, and
+     * iteration is strictly in insertion order.
+     * - If `BagThresholds::get().len() == 64`, and the thresholds are determined according to
+     * the procedure given above, then the constant ratio is equal to 2.
+     * - If `BagThresholds::get().len() == 200`, and the thresholds are determined according to
+     * the procedure given above, then the constant ratio is approximately equal to 1.248.
+     * - If the threshold list begins `[1, 2, 3, ...]`, then an id with score 0 or 1 will fall
+     * into bag 0, an id with score 2 will fall into bag 1, etc.
+     *
+     * # Migration
+     *
+     * In the event that this list ever changes, a copy of the old bags list must be retained.
+     * With that `List::migrate` can be called, which will perform the appropriate migration.
+     **/
+    bagThresholds: Array<bigint>;
+
+    /**
+     * Maximum number of accounts that may be re-bagged automatically in `on_idle`.
+     *
+     * A value of `0` (obtained by configuring `type MaxAutoRebagPerBlock = ();`) disables
+     * the feature.
+     **/
+    maxAutoRebagPerBlock: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `DelegatedStaking`'s constants
+   **/
+  delegatedStaking: {
+    /**
+     * Injected identifier for the pallet.
+     **/
+    palletId: FrameSupportPalletId;
+
+    /**
+     * Fraction of the slash that is rewarded to the caller of pending slash to the agent.
+     **/
+    slashRewardFraction: Perbill;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `StakingRcClient`'s constants
+   **/
+  stakingRcClient: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `MultiBlockElection`'s constants
+   **/
+  multiBlockElection: {
+    /**
+     * Duration of the unsigned phase.
+     **/
+    unsignedPhase: number;
+
+    /**
+     * Duration of the signed phase.
+     **/
+    signedPhase: number;
+
+    /**
+     * Duration of the singed validation phase.
+     *
+     * The duration of this should not be less than `T::Pages`, and there is no point in it
+     * being more than `SignedPhase::MaxSubmission::get() * T::Pages`. TODO: integrity test for
+     * it.
+     **/
+    signedValidationPhase: number;
+
+    /**
+     * The number of snapshot voters to fetch per block.
+     **/
+    voterSnapshotPerBlock: number;
+
+    /**
+     * The number of snapshot targets to fetch per block.
+     **/
+    targetSnapshotPerBlock: number;
+
+    /**
+     * The number of pages.
+     *
+     * The snapshot is created with this many keys in the storage map.
+     *
+     * The solutions may contain at MOST this many pages, but less pages are acceptable as
+     * well.
+     **/
+    pages: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `MultiBlockElectionVerifier`'s constants
+   **/
+  multiBlockElectionVerifier: {
+    /**
+     * The minimum amount of improvement to the solution score that defines a solution as
+     * "better".
+     **/
+    solutionImprovementThreshold: Perbill;
+
+    /**
+     * Maximum number of backers, per winner, among all pages of an election.
+     *
+     * This can only be checked at the very final step of verification.
+     *
+     * NOTE: at the moment, we don't check this, and it is in place for future compatibility.
+     **/
+    maxBackersPerWinnerFinal: number;
+
+    /**
+     * Maximum number of backers, per winner, per page.
+     **/
+    maxBackersPerWinner: number;
+
+    /**
+     * Maximum number of supports (aka. winners/validators/targets) that can be represented in
+     * a page of results.
+     **/
+    maxWinnersPerPage: number;
+
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `MultiBlockElectionUnsigned`'s constants
+   **/
+  multiBlockElectionUnsigned: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `MultiBlockElectionSigned`'s constants
+   **/
+  multiBlockElectionSigned: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
   /**
    * Pallet `Sudo`'s constants
    **/
@@ -819,4 +1480,22 @@ export interface ChainConsts<Rv extends RpcVersion> extends GenericChainConsts<R
      **/
     [name: string]: any;
   };
+  /**
+   * Pallet `AhOps`'s constants
+   **/
+  ahOps: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
+  /**
+   * Pallet `AhMigrator`'s constants
+   **/
+  ahMigrator: {
+    /**
+     * Generic pallet constant
+     **/
+    [name: string]: any;
+  };
 }