meta sp_corecrypto,AccountId32 [u8; 32]  0frame_system,AccountInfoIndex,AccountDatanonceIndex$consumers RefCount$providers RefCount,sufficients RefCountdata,AccountData>044(sp_runtimegenericdigest(DigestItemHash$$Consensus8DConsensusEngineId(VecSeal8DConsensusEngineId(VecDChangesTrieSignal<DChangesTrieSignalOther(VecdRuntimeEnvironmentUpdated8<(sp_runtimegenericdigestDChangesTrieSignal@NewConfiguration@Option@OptionTDNoneSomeDD sp_core0changes_trie`ChangesTrieConfigurationP@polkadot_runtimeEventSystemTpframe_system::Event$Schedulerppallet_scheduler::EventIndicesxpallet_indices::Event Balances|pallet_balances::EventStakingxpallet_staking::Event OffencesXpallet_offences::EventSessionTpallet_session::Event GrandpaTpallet_grandpa::Event ImOnlinepallet_im_online::Event $Democracypallet_democracy::EventCouncilpallet_collective::EventHTechnicalCommitteepallet_collective::Event@PhragmenElectionpallet_elections_phragmen::EventLTechnicalMembershippallet_membership::Event Treasury|pallet_treasury::EventClaimsXclaims::EventVestingxpallet_vesting::EventUtilityTpallet_utility::Event Identity|pallet_identity::EventProxyppallet_proxy::Event Multisig)|pallet_multisig::Event Bounties1|pallet_bounties::Event"Tips5lpallet_tips::Event#hElectionProviderMultiPhase9pallet_election_provider_multi_phase::Event$4ParaInclusionEparachains_inclusion::Event5Parasu\parachains_paras::Event8 UmpyTparachains_ump::Event;Hrmp|parachains_hrmp::Event<$Registrar|paras_registrar::EventFSlotsTslots::EventG Auctions`auctions::EventH$Crowdloandcrowdloan::EventIT 0frame_systempalletEventT@ExtrinsicSuccessX0DispatchInfoAn extrinsic completed successfully. \[info\]x>|8DispatchResultDispatched some task. \[task, id, result\]0Events type.txOptionT(NoneSome(|ResultTEdOk Errd 8pallet_indicespalletEventT 4IndexAssigned0T::AccountId0BalanceOf UThe era payout has been set; the first balance is the validator-payout; the second isthe remainder from the maximum amount of reward.\[era_index, validator_payout, remainder\] Rewarded0T::AccountId0BalanceOfThe nominator has been rewarded by this amount. \[stash, amount\]Slashed0T::AccountId0BalanceOf!One validator (and its nominators) has been slashed by the given amount.T\[validator, amount\]hOldSlashingReportDiscarded0SessionIndexAn old slashing report from a prior era was discarded because it couldnot be processed. \[session_index\]8StakersElectedA new set of stakers was elected.Bonded0T::AccountId0BalanceOfAn account has bonded this amount. \[stash, amount\]MNOTE: This event is only emitted when funds are bonded via a dispatchable. Notably,!it will not be emitted for staking rewards when they are added to stake. Unbonded0T::AccountId0BalanceOfAn account has unbonded this amount. \[stash, amount\]$Withdrawn0T::AccountId0BalanceOfYAn account has called `withdraw_unbonded` and removed unbonding chunks worth `Balance`from the unlocking queue. \[stash, amount\]Kicked0T::AccountId0T::AccountId A nominator has been kicked from a validator. \[nominator, stash\]TStakingElectionFailed The election failed. No new era is planned.Chilled0T::AccountId !An account has stopped participating as either a validator or nominator.$\[stash\]4PayoutStarted EraIndex0T::AccountId The stakers' rewards are getting paid. \[era_index, validator_stash\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. >9At the end of the session, at least one validator was found to be \[offline\]. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. @pallet_im_onlinesr25519,app_sr25519Public>8pallet_stakingHIndividualExposure$AccountIdBalance who$AccountIdvalueBalance @pallet_democracypalletEventTD Proposed$PropIndex0BalanceOf-A motion has been proposed by a public account. \[proposal_index, deposit\]Tabled $PropIndex0BalanceOfDVecEA public proposal has been tabled for referendum vote. \[proposal_index, deposit,0depositors\]8ExternalTabledAn external proposal has been tabled.Started ]A proposal's preimage was noted, and the deposit taken. \[proposal_hash, who, deposit\]0PreimageUsed $T::Hash0T::AccountId0BalanceOf A proposal preimage was removed and used (the deposit was returned).\[proposal_hash, provider, deposit\]0T::AccountId)A registered preimage was removed and the deposit collected by the reaper.\[proposal_hash, provider, deposit, reaper\],Blacklisted$T::HashA proposal \[hash\] has been blacklisted permanently. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  @pallet_democracy8vote_threshold4VoteThreshold PSuperMajorityApprovePSuperMajorityAgainst8SimpleMajority Dpallet_collectivepalletEventTI Proposed0T::AccountId4ProposalIndex$T::Hash,MemberCount IA motion (given hash) has been proposed (by given account) with a threshold (given<`MemberCount`).\[account, proposal_index, proposal_hash, threshold\]Voted0T::AccountId$T::Hashbool,MemberCount,MemberCount A motion (given hash) has been voted on by given account, leavinga tally (yes votes and no votes given respectively as `MemberCount`).\[account, proposal_hash, voted, yes, no\] Approved$T::HashA motion was approved by the required threshold.D\[proposal_hash\],Disapproved$T::HashA motion was not approved by the required threshold.D\[proposal_hash\] Executed$T::Hash|8DispatchResult!A motion was executed; result will be `Ok` if it returned without error.d\[proposal_hash, result\]8MemberExecuted$T::Hash|8DispatchResultIA single member did some action; result will be `Ok` if it returned without error.d\[proposal_hash, result\]Closed $T::Hash,MemberCount,MemberCountUA proposal was closed because its threshold was reached or after its duration was up.h\[proposal_hash, yes, no\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  Dpallet_collectivepalletEventTI Proposed0T::AccountId4ProposalIndex$T::Hash,MemberCount IA motion (given hash) has been proposed (by given account) with a threshold (given<`MemberCount`).\[account, proposal_index, proposal_hash, threshold\]Voted0T::AccountId$T::Hashbool,MemberCount,MemberCount A motion (given hash) has been voted on by given account, leavinga tally (yes votes and no votes given respectively as `MemberCount`).\[account, proposal_hash, voted, yes, no\] Approved$T::HashA motion was approved by the required threshold.D\[proposal_hash\],Disapproved$T::HashA motion was not approved by the required threshold.D\[proposal_hash\] Executed$T::Hash|8DispatchResult!A motion was executed; result will be `Ok` if it returned without error.d\[proposal_hash, result\]8MemberExecuted$T::Hash|8DispatchResultIA single member did some action; result will be `Ok` if it returned without error.d\[proposal_hash, result\]Closed $T::Hash,MemberCount,MemberCountUA proposal was closed because its threshold was reached or after its duration was up.h\[proposal_hash, yes, no\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. dpallet_elections_phragmenpalletEventTNewTermVec<(::AccountId, BalanceOf)>UA new term with \[new_members\]. This indicates that enough candidates existed to runUthe election, not that enough have has been elected. The inner value must be examinedEfor this purpose. A `NewTerm(\[\])` indicates that some candidates got their bondUslashed and none were elected, whilst `EmptyTerm` means that no candidates existed to,begin with.$EmptyTerm1No (or not enough) candidates existed for this round. This is different from`NewTerm(\[\])`. See the description of `NewTerm`.4ElectionErrorInternal error happened while trying to perform election.0MemberKicked::AccountIdQA \[member\] has been removed. This should always be followed by either `NewTerm` or0`EmptyTerm`.$Renounced::AccountIdSomeone has renounced their candidacy.@CandidateSlashed::AccountId0BalanceOfYA \[candidate\] was slashed by \[amount\] due to failing to obtain a seat as member or(runner-up.Note that old members and runners-up are also candidates.DSeatHolderSlashed::AccountId0BalanceOfUA \[seat holder\] was slashed by \[amount\] by being forcefully removed from the set. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  Dpallet_membershippalletEventTI,MemberAddedThe given member was added; see the transaction for who.4MemberRemovedThe given member was removed; see the transaction for who.8MembersSwappedTwo members were swapped; see the transaction for who.0MembersResetThe membership was reset; see the transaction for who the new set is.(KeyChangedOne of the members' keys changed.DummylPhantom member, never used. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  9We have ended a spend period and will now allocate funds. \[budget_remaining\]Awarded 4ProposalIndex0T::AccountIdSome funds have been allocated. \[proposal_index, award, beneficiary\] Rejected4ProposalIndex!A proposal was rejected; funds were slashed. \[proposal_index, slashed\]BurntSome of our funds have been burnt. \[burn\] Rollover-Spending has finished; this is the amount that rolls over until next spend.P\[budget_remaining\]DepositSome funds have been deposited. \[deposit\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. \polkadot_runtime_commonclaimspalletEventTClaimed 0T::AccountId Someone claimed some DOTs. `[who, ethereum_address, amount]` The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  \polkadot_runtime_commonclaims QThe amount vested has been updated. This could indicate a change in funds available.%The balance given is the amount which is left unvested (and thus locked).T\[account, unvested\]@VestingCompleted0T::AccountIdAn \[account\] has become fully vested. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  8pallet_utilitypalletEvent @BatchInterrupted u32d4DispatchErrorUBatch of dispatches did not complete fully. Index of first failing dispatch given, aswell as the error. \[index, error\]8BatchCompletedBatch of dispatches completed fully with no error.4ItemCompletedA single item within a Batch of dispatches has completed with no error. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  A name was cleared, and the given balance returned. \[who, deposit\]8IdentityKilled0T::AccountId0BalanceOf A name was removed and the given balance slashed. \[who, deposit\]HJudgementRequested0T::AccountId8RegistrarIndexA judgement was asked from a registrar. \[who, registrar_index\]PJudgementUnrequested0T::AccountId8RegistrarIndexA judgement request was retracted. \[who, registrar_index\]8JudgementGiven0T::AccountId8RegistrarIndexA judgement was given by a registrar. \[target, registrar_index\]8RegistrarAdded8RegistrarIndexA registrar was added. \[registrar_index\]@SubIdentityAdded 0T::AccountId0T::AccountId0BalanceOfQA sub-identity was added to an identity and the deposit paid. \[sub, main, deposit\]HSubIdentityRemoved 0T::AccountId0T::AccountId0BalanceOf A sub-identity was removed from an identity and the deposit freed.X\[sub, main, deposit\]HSubIdentityRevoked 0T::AccountId0T::AccountId0BalanceOf A sub-identity was cleared, and the given deposit repatriated from the%main identity account to the sub-identity account. \[sub, main, deposit\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet.  0pallet_proxypalletEventT4ProxyExecuted|8DispatchResultA proxy was executed correctly, with the given \[result\].@AnonymousCreated0T::AccountId0T::AccountId!0T::ProxyType% u16 Anonymous account has been created by new proxy with given disambiguation index and proxy type. \[anonymous, who, proxy_type,Xdisambiguation_index\]$Announced 0T::AccountId0T::AccountId$4CallHashOfMAn announcement was placed to make a call in the future. \[real, proxy, call_hash\](ProxyAdded0T::AccountId0T::AccountId!0T::ProxyType8T::BlockNumberA proxy was added. \[delegator, delegatee, proxy_type, delay\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. !@polkadot_runtime$ProxyType Any,NonTransfer(GovernanceStakingDIdentityJudgement,CancelProxyAuction%) 0T::AccountId CallHashA multisig operation has been approved by someone.\[approving, timepoint, multisig, call_hash\]@MultisigExecuted0T::AccountId-dTimepoint0T::AccountId CallHash|8DispatchResultUA multisig operation has been executed. \[approving, timepoint, multisig, call_hash\]DMultisigCancelled0T::AccountId-dTimepoint0T::AccountId CallHash]A multisig operation has been cancelled. \[cancelling, timepoint, multisig, call_hash\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. - A bounty proposal was rejected; funds were slashed. \[index, bond\]HBountyBecameActive,BountyIndexA bounty proposal is funded and became active. \[index\]4BountyAwarded,BountyIndex0T::AccountIdA bounty is awarded to a beneficiary. \[index, beneficiary\]4BountyClaimed ,BountyIndex0BalanceOf0T::AccountId A bounty is claimed by beneficiary. \[index, payout, beneficiary\]8BountyCanceled,BountyIndexA bounty is cancelled. \[index\]8BountyExtended,BountyIndexA bounty expiry is extended. \[index\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. 5 ,pallet_tipspalletEventTNewTip$T::HashA new tip suggestion has been opened. \[tip_hash\](TipClosing$T::Hash A tip suggestion has reached threshold and is closing. \[tip_hash\]$TipClosed $T::Hash0T::AccountId0BalanceOfA tip suggestion has been closed. \[tip_hash, who, payout\]0TipRetracted$T::HashA tip suggestion has been retracted. \[tip_hash\](TipSlashed $T::Hash0T::AccountId0BalanceOfA tip suggestion has been slashed. \[tip_hash, finder, deposit\] The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. 9 pallet_election_provider_multi_phasepalletEventT8SolutionStored=UThe election has been finalized, with `Some` of the given computation, or else if the`election failed, `None`. Rewarded::AccountId0BalanceOf%An account has been rewarded for their signed submission being finalized.Slashed::AccountId0BalanceOf!An account has been slashed for submitting an invalid signed submission.HSignedPhaseStarted u32The signed phase of the given round has started.PUnsignedPhaseStarted u32The unsigned phase of the given round has started. The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. =pallet_election_provider_multi_phasei HeadDatam$CoreIndexq(GroupIndexA candidate was backed. `[candidate, head_data]`DCandidateIncludedIdCandidateReceipti HeadDatam$CoreIndexq(GroupIndexA candidate was included. `[candidate, head_data]`DCandidateTimedOut IdCandidateReceipti HeadDatam$CoreIndexA candidate timed out. `[candidate, head_data]` The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. I Lpolkadot_primitivesv1@CandidateReceiptH$(descriptorMXCandidateDescriptor@commitments_hash$HashM Lpolkadot_primitivesv1LCandidateDescriptorH$$para_idQId0relay_parent$H collatorU(CollatorIdxpersisted_validation_data_hash$Hash pov_hash$Hash0erasure_root$Hash$signatureYDCollatorSignature$para_head$HashPvalidation_code_hasheHValidationCodeHashQ Hpolkadot_parachain(primitivesId u32ULpolkadot_primitivesv00collator_appPublicm Lpolkadot_primitivesv1$CoreIndex u32q Lpolkadot_primitivesv1(GroupIndex u32ulpolkadot_runtime_parachainsparaspalletEventHCurrentCodeUpdatedQParaIdCurrent code has been updated for a Para. `para_id`HCurrentHeadUpdatedQParaIdCurrent head has been updated for a Para. `para_id`PCodeUpgradeScheduledQParaIdA code upgrade has been scheduled for a Para. `para_id`0NewHeadNotedQParaIdA new head has been noted for a Para. `para_id`0ActionQueuedQParaId0SessionIndexA para has been queued to execute pending actions. `para_id` The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. ylpolkadot_runtime_parachains umppalletEvent4InvalidFormat$MessageIdxUpward message is invalid XCM. \[ id \]HUnsupportedVersion$MessageIdUpward message is unsupported version of XCM. \[ id \]8ExecutedUpward$MessageId}OutcomeUpward message executed with the given outcome.D\[ id, outcome \]A new `[lease_period]` is beginning.LeasedQParaId0T::AccountId@LeasePeriodOf@LeasePeriodOf0BalanceOf0BalanceOf5A para has won the right to a continuous set of lease periods as a parachain.EFirst balance is any extra amount reserved on top of the para's existing deposit.Second balance is the total amount reserved.I`[parachain_id, leaser, period_begin, period_count, extra_reserved, total_amount]` The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. \polkadot_runtime_common auctionspalletEventT8AuctionStarted 0AuctionIndex@LeasePeriodOf8T::BlockNumber IAn auction started. Provides its index and the block number where it will begin toclose and the first lease period of the quadruplet that is auctioned.`[auction_index, lease_period, ending]`4AuctionClosed0AuctionIndexAn auction ended. All funds become unreserved. `[auction_index]` Reserved 0T::AccountId0BalanceOf0BalanceOfIFunds were reserved for a winning bid. First balance is the extra amount reserved.Second is the total. `[bidder, extra_reserved, total_amount]`(Unreserved0T::AccountId0BalanceOf)Funds were unreserved since bidder is no longer active. `[bidder, amount]`HReserveConfiscated QParaId0T::AccountId0BalanceOf uSomeone attempted to lease the same slot twice for a parachain. The amount is held in reservebut no parachain slot has been leased.`[parachain_id, leaser, amount]`,BidAccepted0T::AccountIdQParaId0BalanceOf@LeasePeriodOf@LeasePeriodOfA new bid has been accepted as the current winner.`[who, para_id, amount, first_slot, last_slot]`4WinningOffset0AuctionIndex8T::BlockNumbermThe winning offset was chosen for an auction. This will map into the `Winning` storage map.|`[auction_index, block_number]` The [event](https://substrate.dev/docs/en/knowledgebase/runtime/events) emitted by this pallet. \polkadot_runtime_common$crowdloanpalletEventT(CreatedQParaIdCreate a new crowdloaning campaign. `[fund_index]`,Contributed 0T::AccountIdQParaId0BalanceOfContributed to a crowd sale. `[who, fund_index, amount]` Withdrew 0T::AccountIdQParaId0BalanceOf Withdrew full balance of a contributor. `[who, fund_index, amount]`DPartiallyRefundedQParaId-The loans in a fund have been partially dissolved, i.e. there are some leftover child keys that still need to be killed. `[fund_index]`,AllRefundedQParaIdAll loans in a fund have been refunded. `[fund_index]`$DissolvedQParaIdFund is dissolved. `[fund_index]`A memo has been updated. `[who, fund_index, memo]`$spec_namedsp_runtime::RuntimeString 0frame_systempalletCallT((fill_blockratioPerbillA dispatch that will fill the block weight up to the given ratio.remarkremark(VechMake some on-chain remark.(# - `O(1)`,# 8set_heap_pagespages  u64$Set the number of pages in the WebAssembly environment's heap.(# - `O(1)`H- 1 storage write.`- Base Weight: 1.405 µs\- 1 write to HEAP_PAGES<- 1 digest item,# set_codecode(Vec0dSet the new runtime code.(# 1- `O(C + S)` where `C` length of `code` and `S` complexity of `can_set_code`E- 1 call to `can_set_code`: `O(S)` (calls `sp_io::misc::runtime_version` which is4 expensive).- 1 storage write (codec `O(C)`).@- 1 digest item.(- 1 event.MThe weight of this function is dependent on the runtime, but generally this is veryexpensive. We will treat this as a full block.,# \set_code_without_checkscode(Vec$Set the new runtime code without doing any checks of the given `code`.(# - `O(C)` where `C` length of `code`- 1 storage write (codec `O(C)`).@- 1 digest item.(- 1 event.UThe weight of this function is dependent on the runtime. We will treat this as a fullHblock. # \set_changes_trie_configLchanges_trie_config@Option(Set the new changes trie configuration.(# - `O(1)`- 1 storage write or delete (codec `O(1)`).- 1 call to `deposit_log`: Uses `append` API, so O(1)`- Base Weight: 7.218 µs0- DB Weight: - Writes: Changes Trie, System Digest,# ,set_storageitems4Vec hSet some items of storage.(# - `O(I)` where `I` length of `items`x- `I` storage writes (`O(1)`).p- Base Weight: 0.568 * i µsd- Writes: Number of items,# 0kill_storagekeys Vec tKill some items from storage.(# - `O(IK)` where `I` length of `keys` and `K` length of one key`- `I` storage deletions.l- Base Weight: .378 * i µsd- Writes: Number of items,# ,kill_prefixprefix( Keysubkeys u32,Kill all storage items with a key that starts with the given prefix.9**NOTE:** We rely on the Root origin to provide us the number of subkeys under=the prefix we are removing to accurately calculate the weight of this function.(# - `O(P)` where `P` amount of keys with prefix `prefix``- `P` storage deletions.p- Base Weight: 0.834 * P µs|- Writes: Number of subkeys + 1,# Dremark_with_eventremark(Vec Make some on-chain remark and emit event.(# - `O(b)` where b is the length of the remark.(- 1 event.,# %Contains one variant per dispatchable that can be called by an extrinsic. 4sp_arithmetic(per_thingsPerbill u32((( 0frame_systemlimits0BlockWeights (base_block Weight$max_block Weight$per_classPerDispatchClass 4frame_supportweights@PerDispatchClassT normalT,operationalT$mandatoryT 0frame_systemlimits$max_total8Option reserved8OptionOptionT NoneSome  0frame_systemlimits,BlockLength maxTPerDispatchClass 4frame_supportweights@PerDispatchClassT normalT,operationalT$mandatoryT 4frame_supportweights> priorityHschedule::Prioritycall Call8maybe_periodicOption>origin4PalletsOrigin @polkadot_runtimeCallSystemself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor$Scheduler self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForBabeself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor$Timestamp=self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForIndicesEself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor BalancesIself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor(AuthorshipUself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForStaking]self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForSessionself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor Grandpaself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor ImOnlineself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor $Democracyself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForCouncilself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForHTechnicalCommitteeself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor@PhragmenElectionself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForLTechnicalMembershipself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor Treasuryself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForClaims self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForVesting%self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForUtility-self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor Identity5self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForProxyself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor Multisigself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor Bountiesself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor"Tipsself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor#hElectionProviderMultiPhaseself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor$4Configurationself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor3,ParasSharedself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor44ParaInclusionself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor50ParaInherentself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor6ParasQself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor8,InitializerUself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor9 DmpYself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor: Ump]self::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor;Hrmpaself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallFor<$Registrareself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForFSlotsiself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForG Auctionsmself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForH$Crowdloanuself::sp_api_hidden_includes_construct_runtime::hidden_include::dispatch ::CallableCallForI  @pallet_schedulerpalletCallT schedulewhen8T::BlockNumber8maybe_periodicOption> priorityHschedule::Prioritycall `Box<::Call>(pAnonymously schedule a task.(# - S = Number of already scheduled calls- Base Weight: 22.29 + .126 * S µs0- DB Weight:H - Read: AgendaL - Write: Agenda9- Will use base weight of 25 which should be good for up to 30 scheduled calls,# cancelwhen8T::BlockNumberindex u32(Cancel an anonymously scheduled task.(# - S = Number of already scheduled calls- Base Weight: 22.15 + 2.869 * S µs0- DB Weight:H - Read: Agendal - Write: Agenda, Lookup=- Will use base weight of 100 which should be good for up to 30 scheduled calls,# 8schedule_namedid(Vecwhen8T::BlockNumber8maybe_periodicOption> priorityHschedule::Prioritycall `Box<::Call>(XSchedule a named task.(# - S = Number of already scheduled calls- Base Weight: 29.6 + .159 * S µs0- DB Weight:h - Read: Agenda, Lookupl - Write: Agenda, LookupI- Will use base weight of 35 which should be good for more than 30 scheduled calls,# 0cancel_namedid(Vec(xCancel a named scheduled task.(# - S = Number of already scheduled calls- Base Weight: 24.91 + 2.907 * S µs0- DB Weight:h - Read: Agenda, Lookupl - Write: Agenda, Lookup=- Will use base weight of 100 which should be good for up to 30 scheduled calls,# 8schedule_afterafter8T::BlockNumber8maybe_periodicOption> priorityHschedule::Prioritycall `Box<::Call>Anonymously schedule a task after a delay.(# TSame as [`schedule`].,# Pschedule_named_afterid(Vecafter8T::BlockNumber8maybe_periodicOption> priorityHschedule::Prioritycall `Box<::Call>Schedule a named task after a delay.(# Same as [`schedule_named`](Self::schedule_named).,# %Contains one variant per dispatchable that can be called by an extrinsic.OptionTtNoneSomet ,pallet_babepalletCallT Lreport_equivocationHequivocation_proofBox>>! (sp_runtimetraits,BlakeTwo256% Dsp_consensus_babe appPublic>1- `O(1)` (Note that implementations of `OnTimestampSet` must also be `O(1)`)a- 1 storage read and 1 storage mutation (codec `O(1)`). (because of `DidUpdate::take` in@ `on_finalize`)- 1 event handler `on_timestamp_set`. Must be `O(1)`.,# %Contains one variant per dispatchable that can be called by an extrinsic.A E 8pallet_indicespalletCallTclaimindex$- `O(1)`.- One storage mutation (codec `O(1)`).`- One reserve operation.0- One event.L-------------------- DB Weight: 1 Read/Write (Accounts),# transfer new0T::AccountIdindex$- `O(1)`.- One storage mutation (codec `O(1)`).d- One transfer operation.0- One event.L-------------------0- DB Weight: - Reads: Indices Accounts, System Account (recipient) - Writes: Indices Accounts, System Account (recipient),# freeindex$- `O(1)`.- One storage mutation (codec `O(1)`).`- One reserve operation.0- One event.L-------------------- DB Weight: 1 Read/Write (Accounts),# 8force_transfer  new0T::AccountIdindex$- `O(1)`.- One storage mutation (codec `O(1)`).x- Up to one reserve operation.0- One event.L-------------------0- DB Weight: - Reads: Indices Accounts, System Account (original owner) - Writes: Indices Accounts, System Account (original owner),# freezeindex$- `O(1)`.- One storage mutation (codec `O(1)`).p- Up to one slash operation.0- One event.L-------------------- DB Weight: 1 Read/Write (Accounts),# %Contains one variant per dispatchable that can be called by an extrinsic.I ::Sourcevalue(T::BalancepTransfer some liquid free balance to another account.`transfer` will set the `FreeBalance` of the sender and receiver.It will decrease the total issuance of the system by the `TransferFee`.If the sender's account is below the existential deposit as a resultof the transfer, the account will be reaped.The dispatch origin for this call must be `Signed` by the transactor.(# a- Dependent on arguments but not critical, given proper implementations for input config types. See related functions below.1- It contains a limited number of reads and writes internally and no complex8 computation.HRelated functions:M - `ensure_can_withdraw` is always called internally but has a bounded complexity.) - Transferring balances to accounts that did not exist before will cause `T::OnNewAccount::on_new_account` to be called.] - Removing enough funds from an account will trigger `T::DustRemoval::on_unbalanced`.] - `transfer_keep_alive` works the same way as `transfer`, but has an additional check that the transfer will not kill the origin account.---------------------------------A- Base Weight: 73.64 µs, worst case scenario (account created, account removed)- DB Weight: 1 Read and 1 Write to destination account- Origin account is already in memory, so no DB operations for them.,# ,set_balance  whoM::Source new_free(T::Balance0new_reserved(T::BalanceHSet the balances of a given account.This will alter `FreeBalance` and `ReservedBalance` in storage. it willalso decrease the total issuance of the system (`TotalIssuance`).If the new free or reserved balance is below the existential deposit,it will reset the account nonce (`frame_system::AccountNonce`).The dispatch origin for this call is `root`.(# |- Independent of the arguments.- Contains a limited number of reads and writes.T---------------------8- Base Weight:d - Creating: 27.56 µs` - Killing: 35.11 µs- DB Weight: 1 Read, 1 Write to `who`,# 8force_transfer sourceM::SourcedestM::Sourcevalue(T::BalanceMExactly as `transfer`, except the origin must be root and the source account may be(specified.(# M- Same as transfer, but additional read and write because the source account is not| assumed to be in the overlay.,# Ltransfer_keep_alivedestM::Sourcevalue(T::Balance,MSame as the [`transfer`] call, but with a check that the transfer will not kill the- Cheaper than transfer because account cannot be killed.\- Base Weight: 51.4 µs- DB Weight: 1 Read and 1 Write to dest (sender is in overlay already)(#0transfer_alldestM::Source(keep_aliveboolDTransfer the entire transferable balance from the caller account.YNOTE: This function only attempts to transfer _transferable_ balances. This means thataany locked, reserved, or existential deposits (when `keep_alive` is `true`), will not be]transferred by this function. To ensure that this function results in a killed account,Eyou might need to prepare the account by removing any reference counters, storage@deposits, etc...The dispatch origin of this call must be Signed.- `dest`: The recipient of the transfer.Y- `keep_alive`: A boolean to determine if the `transfer_all` operation should send allM of the funds the account has, causing the sender account to be killed (false), orY transfer everything except at least the existential deposit, which will guarantee to keep the sender account alive (true). # 9- O(1). Just like transfer, but reading the user's transferable balance first.0 #::Sourceamount(T::Balance Unreserve some balance from a user by force.lCan only be called by ROOT.%Contains one variant per dispatchable that can be called by an extrinsic.M (sp_runtime0multiaddress0MultiAddress$AccountId0AccountIndexId$AccountIdIndexQ0AccountIndex Raw(Vec$Address32 [u8; 32]$Address20  [u8; 20]QU Dpallet_authorshippalletCallT(set_uncles(new_unclesY8Vec`Provide a set of uncles.%Contains one variant per dispatchable that can be called by an extrinsic.Y]8pallet_stakingpalletpalletCallTdbond (controllerM::Sourcevalue0BalanceOfpayeea|RewardDestinationDaTake the origin account as a stash and lock up `value` of its balance. `controller` willbe the account that controls it.-`value` must be more than the `minimum_balance` specified by `T::Currency`.!The dispatch origin for this call must be _Signed_ by the stash account.- Independent of the arguments. Moderate complexity.- O(1).d- Three extra DB entries.MNOTE: Two of the storage writes (`Self::bonded`, `Self::payee`) are _never_ cleaned=unless the `origin` falls below _existential deposit_ and gets removed as dust.H------------------,# (bond_extra8max_additional0BalanceOf- Independent of the arguments. Insignificant complexity.- O(1).,# unbondvalue0BalanceOfLQSchedule a portion of the stash to be unlocked ready for transfer out after the bondperiod ends. If this leaves an amount actively bonded less than!T::Currency::minimum_balance(), then it is increased to the full amount.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash.EOnce the unlock period is done, you can call `withdraw_unbonded` to actually movethe funds out of management ready for transfer.9No more than a limited number of unlocking chunks (see `MAX_UNLOCKING_CHUNKS`)9can co-exists at the same time. In that case, [`Call::withdraw_unbonded`] needto be called first to remove some of the chunks (if possible).9If a user encounters the `InsufficientBond` error when calling this extrinsic,they should call `chill` first in order to free up their bonded funds.DEmits `Unbonded`.See also [`Call::withdraw_unbonded`].Dwithdraw_unbondedHnum_slashing_spans u32<)Remove any unlocked chunks from the `unlocking` queue from our management.1This essentially frees up that balance to be used by the stash account to doHwhatever it wants.The dispatch origin for this call must be _Signed_ by the controller.HEmits `Withdrawn`.hSee also [`Call::unbond`].(# Complexity O(S) where S is the number of slashing spans to remove NOTE: Weight annotation is the kill scenario, we refund otherwise.,# validateprefse8ValidatorPrefsDeclare the desire to validate for the origin controller.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash. nominatetargetsmVec<::Source>, Declare the desire to nominate `targets` for the origin controller.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash.(# -- The transaction's complexity is proportional to the size of `targets` (N)which is capped at CompactAssignments::LIMIT (MAX_NOMINATIONS).- Both the reads and writes follow a similar pattern.,# chill,Declare no desire to either validate or nominate.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash.(# - Independent of the arguments. Insignificant complexity.P- Contains one read.- Writes are limited to the `origin` account key.,# $set_payeepayeea|RewardDestination@(Re-)set the payment target for a controller.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash.(# - Independent of the arguments. Insignificant complexity.- Contains a limited number of reads.- Writes are limited to the `origin` account key.$---------8- Weight: O(1)0- DB Weight:H - Read: LedgerH - Write: Payee,# 8set_controller(controllerM::Source@(Re-)set the controller of a stash.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the stash, not the controller.(# - Independent of the arguments. Insignificant complexity.- Contains a limited number of reads.- Writes are limited to the `origin` account key.(----------0Weight: O(1)(DB Weight:- Read: Bonded, Ledger New Controller, Ledger Old Controller- Write: Bonded, Ledger New Controller, Ledger Old Controller,# Lset_validator_count new u32 Sets the ideal number of validators.The dispatch origin must be Root.(# 0Weight: O(1)XWrite: Validator Count,# `increase_validator_count(additional u32 Increments the ideal number of validators.The dispatch origin must be Root.(# Same as [`Self::set_validator_count`].,# Tscale_validator_countfactorqPercent Scale up the ideal number of validators by a factor.The dispatch origin must be Root.(# Same as [`Self::set_validator_count`].,# 4force_no_eras <- No arguments.8- Weight: O(1)D- Write: ForceEra,# 4force_new_era @IForce there to be a new era at the end of the next session. After this, it will bereset to normal (non-forced) behaviour.The dispatch origin must be Root.$# WarningThe election process starts multiple blocks before the end of the era.IIf this is called just before a new era is triggered, the election process may nothave enough blocks to get a result.(# <- No arguments.8- Weight: O(1)@- Write ForceEra,# Dset_invulnerables4invulnerablesDVec Set the validators who cannot be slashed (if any).The dispatch origin must be Root.(# - O(V)X- Write: Invulnerables,# 4force_unstakestash0T::AccountIdHnum_slashing_spans u32( Force a current staker to become completely unstaked, immediately.The dispatch origin must be Root.(# O(S) where S is the number of slashing spans to be removedReads: Bonded, Slashing Spans, Account, LocksEWrites: Bonded, Slashing Spans (if S > 0), Ledger, Payee, Validators, Nominators,Account, Locks Writes Each: SpanSlash * S,# Pforce_new_era_always8Force there to be a new era at the end of sessions indefinitely.The dispatch origin must be Root.$# WarningThe election process starts multiple blocks before the end of the era.IIf this is called just before a new era is triggered, the election process may nothave enough blocks to get a result.(# 8- Weight: O(1)D- Write: ForceEra,# Tcancel_deferred_slash era EraIndex4slash_indicesu Vec4Cancel enactment of a deferred slash.Can be called by the `T::SlashCancelOrigin`.Parameters: era and indices of the slashes for that era to kill.(# PComplexity: O(U + S)with U unapplied slashes weighted with U=1000and S is the number of slash indices to be canceled.d- Read: Unapplied Slashesh- Write: Unapplied Slashes,# 8payout_stakers- Time complexity: at most O(MaxNominatorRewardedPerValidator).- Contains a limited number of reads and writes.,-----------N is the Number of payouts for the validator (including the validator)Weight:- Reward Destination Staked: O(N)- Reward Destination Controller (Creating): O(N)M NOTE: weights are assuming that payouts are made to alive stash account (Staked).U Paying even a dead controller is cheaper weight-wise. We don't do any refunds here.,# rebondvalue0BalanceOf$Rebond a portion of the stash scheduled to be unlocked.The dispatch origin must be signed by the controller.(# - Time complexity: O(L), where L is unlocking chunks- Bounded by `MAX_UNLOCKING_CHUNKS`.- Storage changes: Can't increase storage, only decrease it.,# Dset_history_depthDnew_history_depth EraIndexDera_items_deleted u32X-Set `HistoryDepth` value. This function will delete any history information|when `HistoryDepth` is reduced.,Parameters: - `new_history_depth`: The new history depth you would like to set.Y- `era_items_deleted`: The number of items that will be deleted by this dispatch. This] should report all the storage items that will be deleted by clearing old era history.Y Needed to report an accurate weight for the dispatch. Trusted by `Root` to report anH accurate number.POrigin must be root.(# - E: Number of history depths removed, i.e. 10 -> 7 = 38- Weight: O(E)0- DB Weight: - Reads: Current Era, History Depthl - Writes: History Depth- - Clear Prefix Each: Era Stakers, EraStakersClipped, ErasValidatorPrefs% - Writes Each: ErasValidatorReward, ErasRewardPoints, ErasTotalStake,l ErasStartSessionIndex,# (reap_stashstash0T::AccountIdHnum_slashing_spans u32@]Remove all data structure concerning a staker/stash once its balance is at the minimum.]This is essentially equivalent to `withdraw_unbonded` except it can be called by anyoneand the target `stash` must have no funds left beyond the ED.This can be called from any origin.- `stash`: The stash account to reap. Its balance must be zero.(# !Complexity: O(S) where S is the number of slashing spans on the account.(DB Weight:- Reads: Stash Account, Bonded, Slashing Spans, LocksM- Writes: Bonded, Slashing Spans (if S > 0), Ledger, Payee, Validators, Nominators,X Stash Account, Locksp- Writes Each: SpanSlash * S,# kick whomVec<::Source>,Remove the given nominations from the calling validator.Effects will be felt at the beginning of the next era.QThe dispatch origin for this call must be _Signed_ by the controller, not the stash.M- `who`: A list of nominator stash accounts who are nominating this validator which should no longer be nominating this validator.UNote: Making this call only makes sense if you first set the validator preferences toxblock any further nominations.Hset_staking_limitsHmin_nominator_bond0BalanceOfHmin_validator_bond0BalanceOfLmax_nominator_county,OptionLmax_validator_county,Option$threshold}4Update the various staking limits this pallet.%* `min_nominator_bond`: The minimum active bond needed to be a nominator.%* `min_validator_bond`: The minimum active bond needed to be a validator.U* `max_nominator_count`: The max number of users who can be a nominator at once. When set to `None`, no limit is enforced.U* `max_validator_count`: The max number of users who can be a validator at once. When set to `None`, no limit is enforced.Origin must be Root to call this function.5NOTE: Existing nominators and validators will not be affected by this update.to kick people under the new limits, `chill_other` should be called.,chill_other(controller0T::AccountIdTADeclare a `controller` to stop participating as either a validator or nominator.Effects will be felt at the beginning of the next era.AThe dispatch origin for this call must be _Signed_, but can be called by anyone.YIf the caller is the same as the controller being targeted, then no further checks areenforced, and this function behaves just like `chill`.]If the caller is different than the controller being targeted, the following conditions0must be met:=* A `ChillThreshold` must be set and checked which defines how close to the maxU nominators or validators we must reach before users can start chilling one-another.Y* A `MaxNominatorCount` and `MaxValidatorCount` must be set which is used to determine how close we are to the threshold.]* A `MinNominatorBond` and `MinValidatorBond` must be set and checked, which determinesQ if this is a person that should be chilled because they have not met the threshold@ bond required.UThis can be helpful if bond requirements are updated, and we need to remove old userswho do not satisfy these requirements.%Contains one variant per dispatchable that can be called by an extrinsic.a8pallet_stakingDRewardDestination$AccountIdStakedStash(ControllerAccount$AccountIdNonee8pallet_staking8ValidatorPrefs(commissioniPerbillblockedboolimMq 4sp_arithmetic(per_thingsPercentu8uyOptionTNoneSome}OptionTqNoneSomeq 8pallet_sessionpalletCallT set_keyskeysT::Keysproof(Vec8Sets the session key(s) of the function caller to `keys`.Allows an account to set its session key prior to becoming a validator.This doesn't take effect until the next session.The dispatch origin of this function must be signed.(# - Complexity: `O(1)`. Actual cost depends on the number of length of `T::Keys::key_ids()` which is fixed.- DbReads: `origin account`, `T::ValidatorIdOf`, `NextKeys`- DbWrites: `origin account`, `NextKeys`- DbReads per key id: `KeyOwner`- DbWrites per key id: `KeyOwner`,# (purge_keys0Removes any session key(s) of the function caller.This doesn't take effect until the next session.The dispatch origin of this function must be signed.(# a- Complexity: `O(1)` in number of key types. Actual cost depends on the number of length of `T::Keys::key_ids()` which is fixed.- DbReads: `T::ValidatorIdOf`, `NextKeys`, `origin account`- DbWrites: `NextKeys`, `origin account`- DbWrites per key id: `KeyOwner`,# %Contains one variant per dispatchable that can be called by an extrinsic.@polkadot_runtime,SessionKeysgrandpa::Publicbabe%::Public$im_online::Public8para_validator::Public::PublicLauthority_discovery::PublicLpolkadot_primitivesv04validator_appPublic>>Lsp_finality_grandpa0EquivocationH$NPrevote9grandpa::Equivocation, AuthoritySignature>$PrecommitAgrandpa::Equivocation, AuthoritySignature>@finality_grandpa0Equivocation IdVS0round_number  u64 identityIdfirst(V, S)second(V, S)@finality_grandpaPrevoteH$N,target_hash$H4target_numberN Lsp_finality_grandpa app$SignatureHed25519::Signature sp_coreed25519$Signaturea [u8; 64]@finality_grandpa0Equivocation IdVS0round_number  u64 identityIdfirst(V, S)second(V, S)@finality_grandpa$PrecommitH$N,target_hash$H4target_numberN @pallet_im_onlinepalletCallT$heartbeat$heartbeatdHeartbeat$signature::Signature$(# a- Complexity: `O(K + E)` where K is length of `Keys` (heartbeat.validators_len) and E is length of `heartbeat.network_state.external_address` - `O(K)`: decoding of length `K` - `O(E)`: decoding/encoding of length `E`9- DbReads: pallet_session `Validators`, pallet_session `CurrentIndex`, `Keys`,X `ReceivedHeartbeats`- DbWrites: `ReceivedHeartbeats`,# %Contains one variant per dispatchable that can be called by an extrinsic.@pallet_im_online$Heartbeat,BlockNumber0block_number,BlockNumber4network_stateHOpaqueNetworkState4session_index0SessionIndexsp_core0OpaquePeerId(Vec sp_core offchain@pallet_im_onlinesr25519,app_sr25519$Signature]Hsr25519::Signature @pallet_democracypalletCallTdpropose4proposal_hash$T::Hashvalue0BalanceOf,Propose a sensitive action to be taken.The dispatch origin of this call must be _Signed_ and the sender musthave funds to cover the deposit.- `proposal_hash`: The hash of the proposal preimage.- `value`: The amount of deposit (must be at least `MinimumDeposit`).DEmits `Proposed`.8Weight: `O(p)`second proposal$PropIndexLseconds_upper_bound u32(Signals agreement with a particular proposal.The dispatch origin of this call must be _Signed_ and the sendermust have funds to cover the deposit, equal to the original deposit.- `proposal`: The index of the proposal to second.A- `seconds_upper_bound`: an upper bound on the current number of seconds on this% proposal. Extrinsic is weighted according to this value with no refund.Weight: `O(S)` where S is the number of seconds a proposal already has.vote$ref_index>$1Vote in a referendum. If `vote.is_aye()`, the vote is to enact the proposal;otherwise it is a vote to keep the status quo.The dispatch origin of this call must be _Signed_.- `ref_index`: The index of the referendum to vote for.- `vote`: The vote configuration.-Weight: `O(R)` where R is the number of referendums the voter has voted on.@emergency_cancel$ref_index P9Delegate the voting power (with some given conviction) of the sending account.UThe balance delegated is locked for as long as it's delegated, and thereafter for thetime appropriate for the conviction's lock period.]The dispatch origin of this call must be _Signed_, and the signing account must either:t - be delegating already; orY - have no voting activity (if there is, then it will need to be removed/consolidated through `reap_vote` or `unvote`).E- `to`: The account whose voting the `target` account's voting power will follow.U- `conviction`: The conviction that will be attached to the delegated votes. When theA account is undelegated, the funds will be locked for the corresponding period.a- `balance`: The amount of the account's balance to be used in delegating. This must not be more than the account's current balance.HEmits `Delegated`.=Weight: `O(R)` where R is the number of referendums the voter delegating to has voted on. Weight is charged as if maximum votes.(undelegate 0Undelegate the voting power of the sending account.]Tokens may be unlocked following once an amount of time consistent with the lock periodof the conviction with which the delegation was issued.EThe dispatch origin of this call must be _Signed_ and the signing account must beTcurrently delegating.PEmits `Undelegated`.=Weight: `O(R)` where R is the number of referendums the voter delegating to has voted on. Weight is charged as if maximum votes.Xclear_public_proposals pClears all public proposals.The dispatch origin of this call must be _Root_.(]Register the preimage for an upcoming proposal. This doesn't require the proposal to be!in the dispatch queue but does require a deposit, returned once enacted.The dispatch origin of this call must be _Signed_.- `encoded_proposal`: The preimage of a proposal.XEmits `PreimageNoted`.MWeight: `O(E)` with E size of `encoded_proposal` (protected by a required deposit).dnote_preimage_operational@encoded_proposal(Vec Same as `note_preimage` but origin is `OperationalPreimageOrigin`.Xnote_imminent_preimage@encoded_proposal(Vec0ARegister the preimage for an upcoming proposal. This requires the proposal to be=in the dispatch queue. No deposit is needed. When this call is successful, i.e.5the preimage has not been uploaded before and matches some imminent proposal,-Same as `note_imminent_preimage` but origin is `OperationalPreimageOrigin`.4reap_preimage4proposal_hash$T::Hash`proposal_len_upper_bound u32::decode_len()`%Contains one variant per dispatchable that can be called by an extrinsic. @pallet_democracyvote,AccountVoteBalance StandardvoteVotebalanceBalanceSplit ayeBalance nayBalance @pallet_democracyvoteVote @pallet_democracy(conviction(ConvictionNone Locked1x Locked2x Locked3x Locked4x Locked5x Locked6x Dpallet_collectivepalletCallTI,set_members ,new_membersDVecprimePOption$old_count,MemberCountdSet the collective's membership.E- `new_members`: The new member list. Be nice to the chain and provide it sorted.- `prime`: The prime member whose vote sets the default.Y- `old_count`: The upper bound for the previous number of members in storage. Used forP weight estimation.TRequires root origin.QNOTE: Does not enforce the expected `MaxMembers` limit on the amount of members, but! the weight estimations rely on it to estimate dispatchable weight.(# $## WeightP- `O(MP + N)` where: - `M` old-members-count (code- and governance-bounded) - `N` new-members-count (code- and governance-bounded) - `P` proposals-count (code-bounded)- DB:Q - 1 storage mutation (codec `O(M)` read, `O(N)` write) for reading and writing the, members - 1 storage read (codec `O(P)`) for reading the proposalsE - `P` storage mutations (codec `O(M)`) for updating the votes for each proposal] - 1 storage write (codec `O(1)`) for deleting the old `prime` and setting the new one,# execute proposal |Box<>::Proposal>0length_bound u32,Dispatch a proposal from a member using the `Member` origin.Origin must be a member of the collective.(# $## WeightU- `O(M + P)` where `M` members-count (code-bounded) and `P` complexity of dispatching0 `proposal`- DB: 1 read (codec `O(M)`) + DB access of `proposal`$- 1 event,# propose $threshold,MemberCount proposal |Box<>::Proposal>0length_bound u32lAdd a new proposal to either be voted on or executed directly.Requires the sender to be member.A`threshold` determines whether `proposal` is executed directly (`threshold < 2`)Tor put up for voting.(# $## Weight- `O(B + M + P1)` or `O(B + M + P2)` where: - `B` is `proposal` size in bytes (length-fee-bounded) - `M` is members-count (code- and governance-bounded) - branching is influenced by `threshold` where: - `P1` is proposal execution complexity (`threshold < 2`) - `P2` is proposals-count (code-bounded) (`threshold >= 2`)- DB: - 1 storage read `is_member` (codec `O(M)`) - 1 storage read `ProposalOf::contains_key` (codec `O(1)`) - DB accesses influenced by `threshold`:  - EITHER storage accesses done by `proposal` (`threshold < 2`) - OR proposal insertion (`threshold <= 2`) - 1 storage mutation `Proposals` (codec `O(P2)`) - 1 storage mutation `ProposalCount` (codec `O(1)`) - 1 storage write `ProposalOf` (codec `O(B)`) - 1 storage write `Voting` (codec `O(M)`), - 1 event,# vote  proposal$T::Hashindex4ProposalIndexapprovebool$## Weight - `O(M)` where `M` is members-count (code- and governance-bounded)- DB: - 1 storage read `Members` (codec `O(M)`) - 1 storage mutation `Voting` (codec `O(M)`)$- 1 event,# close4proposal_hash$T::Hashindex4ProposalIndexTproposal_weight_boundAWeight0length_bound u32MClose a vote that is either approved, disapproved or whose voting period has ended.UMay be called by any signed account in order to finish voting and close the proposal.IIf called before the end of the voting period it will only close the vote if it ishas enough votes to be approved or disapproved.IIf called after the end of the voting period abstentions are counted as rejections%unless there is a prime member set and the prime member cast an approval.aIf the close operation completes successfully with disapproval, the transaction fee will]be waived. Otherwise execution of the approved operation will be charged to the caller.a+ `proposal_weight_bound`: The maximum amount of weight consumed by executing the closed$proposal.a+ `length_bound`: The upper bound for the length of the proposal in storage. Checked via5`storage::read` so it is `size_of::() == 4` larger than the pure length.(# $## Weightt- `O(B + M + P1 + P2)` where: - `B` is `proposal` size in bytes (length-fee-bounded) - `M` is members-count (code- and governance-bounded) - `P1` is the complexity of `proposal` preimage. - `P2` is proposal-count (code-bounded)- DB:  - 2 storage reads (`Members`: codec `O(M)`, `Prime`: codec `O(1)`)Y - 3 mutations (`Voting`: codec `O(M)`, `ProposalOf`: codec `O(B)`, `Proposals`: codec, `O(P2)`) - any mutations done while executing `proposal` (`P1`)@- up to 3 events,# Ldisapprove_proposal4proposal_hash$T::Hash8YDisapprove a proposal, close, and remove it from the system, regardless of its currentstate.Must be called by the Root origin.,Parameters:* `proposal_hash`: The hash of the proposal that should be disapproved.(# Complexity: O(P) where P is the number of max proposals(DB Weight:H* Reads: Proposals* Writes: Voting, Proposals, ProposalOf,# %Contains one variant per dispatchable that can be called by an extrinsic.OptionTNoneSome Dpallet_collectivepalletCallTI,set_members ,new_membersDVecprimePOption$old_count,MemberCountdSet the collective's membership.E- `new_members`: The new member list. Be nice to the chain and provide it sorted.- `prime`: The prime member whose vote sets the default.Y- `old_count`: The upper bound for the previous number of members in storage. Used forP weight estimation.TRequires root origin.QNOTE: Does not enforce the expected `MaxMembers` limit on the amount of members, but! the weight estimations rely on it to estimate dispatchable weight.(# $## WeightP- `O(MP + N)` where: - `M` old-members-count (code- and governance-bounded) - `N` new-members-count (code- and governance-bounded) - `P` proposals-count (code-bounded)- DB:Q - 1 storage mutation (codec `O(M)` read, `O(N)` write) for reading and writing the, members - 1 storage read (codec `O(P)`) for reading the proposalsE - `P` storage mutations (codec `O(M)`) for updating the votes for each proposal] - 1 storage write (codec `O(1)`) for deleting the old `prime` and setting the new one,# execute proposal |Box<>::Proposal>0length_bound u32,Dispatch a proposal from a member using the `Member` origin.Origin must be a member of the collective.(# $## WeightU- `O(M + P)` where `M` members-count (code-bounded) and `P` complexity of dispatching0 `proposal`- DB: 1 read (codec `O(M)`) + DB access of `proposal`$- 1 event,# propose $threshold,MemberCount proposal |Box<>::Proposal>0length_bound u32lAdd a new proposal to either be voted on or executed directly.Requires the sender to be member.A`threshold` determines whether `proposal` is executed directly (`threshold < 2`)Tor put up for voting.(# $## Weight- `O(B + M + P1)` or `O(B + M + P2)` where: - `B` is `proposal` size in bytes (length-fee-bounded) - `M` is members-count (code- and governance-bounded) - branching is influenced by `threshold` where: - `P1` is proposal execution complexity (`threshold < 2`) - `P2` is proposals-count (code-bounded) (`threshold >= 2`)- DB: - 1 storage read `is_member` (codec `O(M)`) - 1 storage read `ProposalOf::contains_key` (codec `O(1)`) - DB accesses influenced by `threshold`:  - EITHER storage accesses done by `proposal` (`threshold < 2`) - OR proposal insertion (`threshold <= 2`) - 1 storage mutation `Proposals` (codec `O(P2)`) - 1 storage mutation `ProposalCount` (codec `O(1)`) - 1 storage write `ProposalOf` (codec `O(B)`) - 1 storage write `Voting` (codec `O(M)`), - 1 event,# vote  proposal$T::Hashindex4ProposalIndexapprovebool$## Weight - `O(M)` where `M` is members-count (code- and governance-bounded)- DB: - 1 storage read `Members` (codec `O(M)`) - 1 storage mutation `Voting` (codec `O(M)`)$- 1 event,# close4proposal_hash$T::Hashindex4ProposalIndexTproposal_weight_boundAWeight0length_bound u32MClose a vote that is either approved, disapproved or whose voting period has ended.UMay be called by any signed account in order to finish voting and close the proposal.IIf called before the end of the voting period it will only close the vote if it ishas enough votes to be approved or disapproved.IIf called after the end of the voting period abstentions are counted as rejections%unless there is a prime member set and the prime member cast an approval.aIf the close operation completes successfully with disapproval, the transaction fee will]be waived. Otherwise execution of the approved operation will be charged to the caller.a+ `proposal_weight_bound`: The maximum amount of weight consumed by executing the closed$proposal.a+ `length_bound`: The upper bound for the length of the proposal in storage. Checked via5`storage::read` so it is `size_of::() == 4` larger than the pure length.(# $## Weightt- `O(B + M + P1 + P2)` where: - `B` is `proposal` size in bytes (length-fee-bounded) - `M` is members-count (code- and governance-bounded) - `P1` is the complexity of `proposal` preimage. - `P2` is proposal-count (code-bounded)- DB:  - 2 storage reads (`Members`: codec `O(M)`, `Prime`: codec `O(1)`)Y - 3 mutations (`Voting`: codec `O(M)`, `ProposalOf`: codec `O(B)`, `Proposals`: codec, `O(P2)`) - any mutations done while executing `proposal` (`P1`)@- up to 3 events,# Ldisapprove_proposal4proposal_hash$T::Hash8YDisapprove a proposal, close, and remove it from the system, regardless of its currentstate.Must be called by the Root origin.,Parameters:* `proposal_hash`: The hash of the proposal that should be disapproved.(# Complexity: O(P) where P is the number of max proposals(DB Weight:H* Reads: Proposals* Writes: Voting, Proposals, ProposalOf,# %Contains one variant per dispatchable that can be called by an extrinsic. dpallet_elections_phragmenpalletCallTvotevotesDVecvalue0BalanceOf\YVote for a set of candidates for the upcoming round of election. This can be called toset the initial votes, or update already existing votes.]Upon initial voting, `value` units of `who`'s balance is locked and a deposit amount isMreserved. The deposit is based on the number of votes and can be updated over time.LThe `votes` should:D - not be empty.U - be less than the number of possible candidates. Note that all current members and runners-up are also automatically candidates for the next round.MIf `value` is more than `who`'s total balance, then the maximum of the two is used.The dispatch origin of this call must be signed.,### WarningUIt is the responsibility of the caller to **NOT** place all of their balance into thelock and keep some for further operations.(# QWe assume the maximum weight among all 3 cases: vote_equal, vote_more and vote_less.,# 0remove_voterlRemove `origin` as a voter.This removes the lock and returns the deposit.The dispatch origin of this call must be signed and be a voter.@submit_candidacy The number of current candidates must be provided as witness data.,# Hrenounce_candidacy(renouncing(RenouncingHMRenounce one's intention to be a candidate for the next election round. 3 potentialThe type of renouncing must be provided as witness data.,# 4remove_member whoM::SourceQIf we have a replacement, we use a small weight. Else, since this is a root call andwill go into phragmen, we assume full block for now.,# Pclean_defunct_voters(num_voters u32,num_defunct u32(EClean all voters who are defunct (i.e. they do not serve any purpose at all). Thedeposit of the removed voters are returned.This is an root function to be used only for cleaning the state.The dispatch origin of this call must be root.(# ]The total number of voters and those that are defunct must be provided as witness data.,# %Contains one variant per dispatchable that can be called by an extrinsic.dpallet_elections_phragmen(Renouncing Member RunnerUp$Candidate u32 Dpallet_membershippalletCallTI(add_member who0T::AccountId xAdd a member `who` to the set.May only be called from `T::AddOrigin`.4remove_member who0T::AccountId Remove a member `who` from the set.May only be called from `T::RemoveOrigin`.,swap_memberremove0T::AccountId add0T::AccountIdSwap out one member `remove` for another `add`.May only be called from `T::SwapOrigin`. Prime membership is *not* passed from `remove` to `add`, if extant.4reset_membersmembersDVecUChange the membership to a new set, disregarding the existing membership. Be nice andhpass `members` pre-sorted.May only be called from `T::ResetOrigin`.(change_key new0T::AccountIdSwap out the sending member for some other key `new`.May only be called from `Signed` origin of a current member.Prime membership is passed from the origin account to `new`, if extant.$set_prime who0T::AccountId Set the prime member. Must be a current member.May only be called from `T::PrimeOrigin`.,clear_prime Remove the prime member if it exists.May only be called from `T::PrimeOrigin`.%Contains one variant per dispatchable that can be called by an extrinsic. ,beneficiaryM::Source$)Put forward a suggestion for spending. A deposit proportional to the value1is reserved and slashed if the proposal is rejected. It is returned once thePproposal is awarded.(# H- Complexity: O(1)- DbReads: `ProposalCount`, `origin account`- DbWrites: `ProposalCount`, `Proposals`, `origin account`,# H- Complexity: O(1)- DbReads: `Proposals`, `rejected proposer account`- DbWrites: `Proposals`, `rejected proposer account`,# @approve_proposal,proposal_id4ProposalIndex(YApprove a proposal. At a later time, the proposal will be allocated to the beneficiaryand the original deposit will be returned.May only be called from `T::ApproveOrigin`.(# L- Complexity: O(1).- DbReads: `Proposals`, `Approvals`X- DbWrite: `Approvals`,# %Contains one variant per dispatchable that can be called by an extrinsic. \polkadot_runtime_commonclaimspalletCallTclaimdest0T::AccountIdHethereum_signature 8EcdsaSignature`Make a claim to collect your DOTs.The dispatch origin for this call must be _None_.PUnsigned Validation:A call to claim is deemed valid if the signature provided matches|the expected signed message of:h> Ethereum Signed Message:> (configured prefix string)(address)and `address` matches the `dest` account.,Parameters:- `dest`: The destination account to payout the claim. - `ethereum_signature`: The signature of an ethereum signed message matching the format described above. The weight of this call is invariant over the input parameters.Weight includes logic to validate unsigned `claim` call.XTotal Complexity: O(1)$(mint_claim who @vesting_scheduleOption<(BalanceOf, BalanceOf, T::BlockNumber)>$statementTOptionThe weight of this call is invariant over the input parameters.We assume worst case that both vesting and statement is being inserted.XTotal Complexity: O(1)$0claim_attest dest0T::AccountIdHethereum_signature 8EcdsaSignature$statement(VechMake a claim to collect your DOTs by signing a statement.The dispatch origin for this call must be _None_.PUnsigned Validation:)A call to `claim_attest` is deemed valid if the signature provided matches|the expected signed message of:h> Ethereum Signed Message:> (configured prefix string)(address)(statement)Iand `address` matches the `dest` account; the `statement` must match that which isexpected according to your purchase arrangement.,Parameters:- `dest`: The destination account to payout the claim. - `ethereum_signature`: The signature of an ethereum signed message matching the format described above.e- `statement`: The identity of the statement which is being attested to in the signature. The weight of this call is invariant over the input parameters.Weight includes logic to validate unsigned `claim_attest` call.XTotal Complexity: O(1)$attest$statement(VecDAttest to a statement, needed to finalize the claims process.eWARNING: Insecure unless your chain includes `PrevalidateAttests` as a `SignedExtension`.PUnsigned Validation:)A call to attest is deemed valid if the sender has a `Preclaim` registeredand provides a `statement` which is expected for the account.,Parameters:e- `statement`: The identity of the statement which is being attested to in the signature. The weight of this call is invariant over the input parameters.Weight includes logic to do pre-validation on `attest` call.XTotal Complexity: O(1)$(move_claim  old %Contains one variant per dispatchable that can be called by an extrinsic.  \polkadot_runtime_commonclaims8EcdsaSignature [u8; 65]AOptionTNoneSome OptionT!NoneSome!! \polkadot_runtime_commonclaims4StatementKindRegularSaft% 8pallet_vestingpalletCallTvest4Unlock any vested funds of the sender account.]The dispatch origin for this call must be _Signed_ and the sender must have funds stilldlocked under this pallet.Emits either `VestingCompleted` or `VestingUpdated`.(# $- `O(1)`.t- DbWeight: 2 Reads, 2 Writes - Reads: Vesting Storage, Balances Locks, [Sender Account] - Writes: Vesting Storage, Balances Locks, [Sender Account],# (vest_othertargetM::Source$- `O(1)`.t- DbWeight: 3 Reads, 3 Writes - Reads: Vesting Storage, Balances Locks, Target Account - Writes: Vesting Storage, Balances Locks, Target Account,# ::Source schedule)VestingInfo, T::BlockNumber>DdCreate a vested transfer.The dispatch origin for this call must be _Signed_.- `target`: The account receiving the vested funds.- `schedule`: The vesting schedule attached to the transfer.\Emits `VestingCreated`.NOTE: This will unlock all schedules through the current block.(# $- `O(1)`.t- DbWeight: 3 Reads, 3 Writes9 - Reads: Vesting Storage, Balances Locks, Target Account, [Sender Account]= - Writes: Vesting Storage, Balances Locks, Target Account, [Sender Account],# Tforce_vested_transfer sourceM::SourcetargetM::Source schedule)VestingInfo, T::BlockNumber>H`Force a vested transfer.The dispatch origin for this call must be _Root_.- `source`: The account whose funds should be transferred.- `target`: The account that should be transferred the vested funds.- `schedule`: The vesting schedule attached to the transfer.\Emits `VestingCreated`.NOTE: This will unlock all schedules through the current block.(# $- `O(1)`.t- DbWeight: 4 Reads, 4 Writes1 - Reads: Vesting Storage, Balances Locks, Target Account, Source Account5 - Writes: Vesting Storage, Balances Locks, Target Account, Source Account,# ::Call>L|Send a batch of dispatch calls.xMay be called from any origin.]- `calls`: The calls to be dispatched from the same origin. The number of call must not9 exceed the constant: `batched_calls_limit` (available in constant metadata).]If origin is root then call are dispatch without checking origin filter. (This includesbypassing `frame_system::Config::BaseCallFilter`).(# - Complexity: O(C) where C is the number of calls to be batched.,# UThis will return `Ok` in all circumstances. To determine the success of the batch, an1event is deposited. If a call failed and the batch was interrupted, then theU`BatchInterrupted` event is deposited, along with the number of successful calls madeMand the error of the failed call. If all were successful, then the `BatchCompleted`Levent is deposited.4as_derivativeindex% u16call `Box<::Call>4Send a call through an indexed pseudonym of the sender.UFilter from origin are passed along. The call will be dispatched with an origin whichuse the same filter as the origin of this call.ENOTE: If you need to ensure that any account-based filtering is not honored (i.e.abecause you expect `proxy` to have been used prior in the call stack and you do not wantQthe call restrictions to apply to any sub-accounts), then use `as_multi_threshold_1`|in the Multisig pallet instead.NOTE: Prior to version *12, this was called `as_limited_sub`.The dispatch origin for this call must be _Signed_.$batch_allcalls1`Vec<::Call>8Send a batch of dispatch calls and atomically execute them.!The whole transaction will rollback and fail if any of the calls failed.xMay be called from any origin.]- `calls`: The calls to be dispatched from the same origin. The number of call must not9 exceed the constant: `batched_calls_limit` (available in constant metadata).]If origin is root then call are dispatch without checking origin filter. (This includesbypassing `frame_system::Config::BaseCallFilter`).(# - Complexity: O(C) where C is the number of calls to be batched.,# %Contains one variant per dispatchable that can be called by an extrinsic.1 5 %- `O(R)` where `R` registrar-count (governance-bounded and code-bounded).- One storage mutation (codec `O(R)`).0- One event.,# 0set_identityinfo9Box>L)Set an account's identity information and reserve the appropriate deposit.UIf the account already has identity information, the deposit is taken as part paymentPfor the new deposit.The dispatch origin for this call must be _Signed_.- `info`: The identity information.Emits `IdentitySet` if successful.(# D- `O(X + X' + R)` - where `X` additional-field-count (deposit-bounded and code-bounded) - where `R` judgements-count (registrar-count-bounded)- One balance reserve operation.!- One storage mutation (codec-read `O(X' + R)`, codec-write `O(X + R)`).0- One event.,# set_subssubsdVec<(T::AccountId, Data)>TSet the sub-accounts of the sender.UPayment: Any aggregate balance reserved by previous `set_subs` calls will be returned-and an amount `SubAccountDeposit` will be reserved for each item in `subs`.aThe dispatch origin for this call must be _Signed_ and the sender must have a registered$identity.- `subs`: The identity's (new) sub-accounts.(# 0- `O(P + S)` - where `P` old-subs-count (hard- and deposit-bounded). - where `S` subs-count (hard- and deposit-bounded).- At most one balance operations.- DB: - `P + S` storage mutations (codec complexity `O(1)`) - One storage read (codec complexity `O(P)`). - One storage write (codec complexity `O(S)`). - One storage-exists (`IdentityOf::contains_key`).,# 8clear_identityH9Clear an account's identity info and all sub-accounts and return all deposits.Payment: All reserved balances on the account are returned.aThe dispatch origin for this call must be _Signed_ and the sender must have a registered$identity.Emits `IdentityCleared` if successful.(# @- `O(R + S + X)` - where `R` registrar-count (governance-bounded). - where `S` subs-count (hard- and deposit-bounded).! - where `X` additional-field-count (deposit-bounded and code-bounded).- One balance-unreserve operation.- `2` storage reads and `S + 2` storage deletions.0- One event.,# Drequest_judgement$reg_index8RegistrarIndexmax_fee0BalanceOf\Request a judgement from a registrar.UPayment: At most `max_fee` will be reserved for payment to the registrar if judgementgiven.5The dispatch origin for this call must be _Signed_ and the sender must have aPregistered identity.- `reg_index`: The index of the registrar whose judgement is requested.U- `max_fee`: The maximum fee that may be paid. This should just be auto-populated as:0```nocompileSelf::registrars().get(reg_index).unwrap().fee ```Emits `JudgementRequested` if successful.(# 4- `O(R + X)`.- One balance-reserve operation.- Storage: 1 read `O(R)`, 1 mutate `O(X + R)`.0- One event.,# 8cancel_request$reg_index8RegistrarIndexDhCancel a previous request.Payment: A previously reserved deposit is returned on success.5The dispatch origin for this call must be _Signed_ and the sender must have aPregistered identity.E- `reg_index`: The index of the registrar whose judgement is no longer requested.Emits `JudgementUnrequested` if successful.(# 4- `O(R + X)`.- One balance-reserve operation.- One storage mutation `O(R + X)`.,- One event,# set_feeindex8RegistrarIndex fee0BalanceOf4Set the fee required for a judgement to be requested from a registrar.UThe dispatch origin for this call must be _Signed_ and the sender must be the accountof the registrar whose index is `index`.- `index`: the index of the registrar whose fee is to be set.T- `fee`: the new fee.(# $- `O(R)`.x- One storage mutation `O(R)`.- Benchmark: 7.315 + R * 0.329 µs (min squares analysis),# 8set_account_idindex8RegistrarIndex new0T::AccountId4Change the account associated with a registrar.UThe dispatch origin for this call must be _Signed_ and the sender must be the accountof the registrar whose index is `index`.- `index`: the index of the registrar whose fee is to be set.p- `new`: the new account ID.(# $- `O(R)`.x- One storage mutation `O(R)`.- Benchmark: 8.823 + R * 0.32 µs (min squares analysis),# (set_fieldsindex8RegistrarIndexfields8IdentityFields4Set the field information for a registrar.UThe dispatch origin for this call must be _Signed_ and the sender must be the accountof the registrar whose index is `index`.- `index`: the index of the registrar whose fee is to be set. - `fields`: the fields that the registrar concerns themselves with.(# $- `O(R)`.x- One storage mutation `O(R)`.- Benchmark: 7.464 + R * 0.325 µs (min squares analysis),# Dprovide_judgement $reg_index8RegistrarIndextargetM::Source$judgement\Judgement> LProvide a judgement for an account's identity.UThe dispatch origin for this call must be _Signed_ and the sender must be the accountof the registrar whose index is `reg_index`.!- `reg_index`: the index of the registrar whose judgement is being made.U- `target`: the account whose identity the judgement is upon. This must be an accountt with a registered identity.I- `judgement`: the judgement of the registrar of index `reg_index` about `target`.Emits `JudgementGiven` if successful.(# 4- `O(R + X)`.- One balance-transfer operation.- Up to one account-lookup operation.- Storage: 1 read `O(R)`, 1 mutate `O(R + X)`.0- One event.,# 4kill_identitytargetM::Source LARemove an account's identity and sub-account information and slash the deposits.aPayment: Reserved balances from `set_subs` and `set_identity` are slashed and handled byE`Slash`. Verification request deposits are not returned; they should be cancelledmanually using `cancel_request`.The dispatch origin for this call must match `T::ForceOrigin`.U- `target`: the account whose identity the judgement is upon. This must be an accountt with a registered identity.Emits `IdentityKilled` if successful.(# D- `O(R + S + X)`.- One balance-reserve operation.p- `S + 2` storage mutations.0- One event.,# add_sub subM::SourcedataEData Add the given account to the sender's subs.]Payment: Balance reserved by a previous `set_subs` call for one sub will be repatriated8to the sender.aThe dispatch origin for this call must be _Signed_ and the sender must have a registeredXsub identity of `sub`.(rename_sub subM::SourcedataEData Alter the associated name of the given sub-account.aThe dispatch origin for this call must be _Signed_ and the sender must have a registeredXsub identity of `sub`.(remove_sub subM::Source Remove the given account from the sender's subs.]Payment: Balance reserved by a previous `set_subs` call for one sub will be repatriated8to the sender.aThe dispatch origin for this call must be _Signed_ and the sender must have a registeredXsub identity of `sub`. quit_sub(Remove the sender as a sub-account.]Payment: Balance reserved by a previous `set_subs` call for one sub will be repatriatedto the sender (*not* the original depositor).aThe dispatch origin for this call must be _Signed_ and the sender must have a registereddisplayEDatalegalEData webEDatariotEDataemailEDataimageEDatatwitterEData=4frame_supportstorage,bounded_vec(BoundedVecTASVecAEEE call `Box<::Call>Weight is a function of the number of proxies the user has (P).,# $add_proxy  delegate0T::AccountId(proxy_type!0T::ProxyTypedelay8T::BlockNumber4ERegister a proxy account for the sender that is able to make calls on its behalf.The dispatch origin for this call must be _Signed_.,Parameters:- `proxy`: The account that the `caller` would like to make a proxy.- `proxy_type`: The permissions allowed for this proxy account.M- `delay`: The announcement period required of the initial proxy. Will generally bezero.(# Weight is a function of the number of proxies the user has (P).,# 0remove_proxy  delegate0T::AccountId(proxy_type!0T::ProxyTypedelay8T::BlockNumber,Unregister a proxy account for the sender.The dispatch origin for this call must be _Signed_.,Parameters:%- `proxy`: The account that the `caller` would like to remove as a proxy.A- `proxy_type`: The permissions currently enabled for the removed proxy account.(# Weight is a function of the number of proxies the user has (P).,# 8remove_proxies(Unregister all proxy accounts for the sender.The dispatch origin for this call must be _Signed_.UWARNING: This may be called on accounts created by `anonymous`, however if done, thenYthe unreserved fees will be inaccessible. **All access to this account will be lost.**(# Weight is a function of the number of proxies the user has (P).,# $anonymous (proxy_type!0T::ProxyTypedelay8T::BlockNumberindex% u16\9Spawn a fresh new account that is guaranteed to be otherwise inaccessible, andinitialize it with a proxy of `proxy_type` for `origin` sender.lRequires a `Signed` origin.Q- `proxy_type`: The type of the proxy that the sender will be registered as over theMnew account. This will almost always be the most permissive `ProxyType` possible toxallow for maximum flexibility.Q- `index`: A disambiguation index, in case this is called multiple times in the same]transaction (e.g. with `utility::batch`). Unless you're using `batch` you probably just@want to use `0`.M- `delay`: The announcement period required of the initial proxy. Will generally bezero.QFails with `Duplicate` if this has already been called in this transaction, from thesame sender, with the same parameters.Fails if there are insufficient funds to pay for deposit.(# Weight is a function of the number of proxies the user has (P).,# TODO: Might be over counting 1 read8kill_anonymousspawner0T::AccountId(proxy_type!0T::ProxyTypeindex% u16height8T::BlockNumber$ext_index u32PRemoves a previously spawned anonymous proxy.IWARNING: **All access to this account will be lost.** Any funds held in it will be4inaccessible.YRequires a `Signed` origin, and the sender account must have been created by a call to`anonymous` with corresponding parameters.M- `spawner`: The account that originally called `anonymous` to create this account.M- `index`: The disambiguation index originally passed to `anonymous`. Probably `0`.- `proxy_type`: The proxy type originally passed to `anonymous`.=- `height`: The height of the chain when the call to `anonymous` was processed.I- `ext_index`: The extrinsic index in which the call to `anonymous` was processed.IFails with `NoPermission` in case the caller is not a previously created anonymousaccount whose `anonymous` call has corresponding parameters.(# Weight is a function of the number of proxies the user has (P).,# announcereal0T::AccountId$call_hash$4CallHashOfTPublish the hash of a proxy-call that will be made in the future.]This must be called some number of blocks before the corresponding `proxy` is attempted%if the delay associated with the proxy relationship is greater than zero.No more than `MaxPending` announcements may be made at any one time. This will take a deposit of `AnnouncementDepositFactor` as well as`AnnouncementDepositBase` if there are no other pending announcements.%The dispatch origin for this call must be _Signed_ and a proxy of `real`.,Parameters: - `real`: The account that the proxy will make a call on behalf of.- `call_hash`: The hash of the call to be made by the `real` account.(# `Weight is a function of:- A: the number of announcements made.- P: the number of proxies the user has.,# Lremove_announcementreal0T::AccountId$call_hash$4CallHashOf@pRemove a given announcement.YMay be called by a proxy account to remove a call they previously announced and return0the deposit.The dispatch origin for this call must be _Signed_.,Parameters: - `real`: The account that the proxy will make a call on behalf of.- `call_hash`: The hash of the call to be made by the `real` account.(# `Weight is a function of:- A: the number of announcements made.- P: the number of proxies the user has.,# Lreject_announcement delegate0T::AccountId$call_hash$4CallHashOf@Remove the given announcement of a delegate.aMay be called by a target (proxied) account to remove a call that one of their delegates%(`delegate`) has announced they want to execute. The deposit is returned.The dispatch origin for this call must be _Signed_.,Parameters:- `delegate`: The account that previously announced the call.- `call_hash`: The hash of the call to be made.(# `Weight is a function of:- A: the number of announcements made.- P: the number of proxies the user has.,# call `Box<::Call> DMDispatch the given `call` from an account that the sender is authorized for through0`add_proxy`.Removes any corresponding announcement(s).The dispatch origin for this call must be _Signed_.,Parameters: - `real`: The account that the proxy will make a call on behalf of.a- `force_proxy_type`: Specify the exact proxy type to be used and checked for this call.- `call`: The call to be made by the `real` account.(# `Weight is a function of:- A: the number of announcements made.- P: the number of proxies the user has.,# %Contains one variant per dispatchable that can be called by an extrinsic.OptionT!NoneSome! call `Box<::Call>@QImmediately dispatch a multi-signature call using a single approval from the caller.The dispatch origin for this call must be _Signed_.=- `other_signatories`: The accounts (other than the sender) who are part of themulti-signature, but do not participate in the approval process.- `call`: The call to be executed.Result is equivalent to the dispatched result.(# O(Z + C) where Z is the length of the call and C its execution weight.|-------------------------------D- DB Weight: NoneH- Plus Call Weight,# as_multi$threshold% u16Dother_signatoriesDVec>call((OpaqueCall(store_callbool(max_weight WeightURegister approval for a dispatch to be made from a deterministic composite account ifapproved by a total of `threshold - 1` of `other_signatories`.If there are enough, then dispatch the call.-Payment: `DepositBase` will be reserved if this is the first approval, plus=`threshold` times `DepositFactor`. It is returned once this dispatch happens or4is cancelled.The dispatch origin for this call must be _Signed_.U- `threshold`: The total number of approvals for this dispatch before it is executed.A- `other_signatories`: The accounts (other than the sender) who can approve thisldispatch. May not be empty.Y- `maybe_timepoint`: If this is the first approval, then this must be `None`. If it isQnot the first approval, then it must be `Some`, with the timepoint (block number andtransaction index) of the first approval transaction.- `call`: The call to be executed.NOTE: Unless this is the final approval, you will generally want to use`approve_as_multi` instead, since it only requires a hash of the call.YResult is equivalent to the dispatched result if `threshold` is exactly `1`. OtherwiseUon success, result is `Ok` and the result from the interior call, if it was executed,may be found in the deposited `MultisigExecuted` event.(# P- `O(S + Z + Call)`.- Up to one balance-reserve or unreserve operation.=- One passthrough operation, one insert, both `O(S)` where `S` is the number ofE signatories. `S` is capped by `MaxSignatories`, with weight being proportional.!- One call encode & hash, both of complexity `O(Z)` where `Z` is tx-len.- One encode & hash, both of complexity `O(S)`.- Up to one binary search and insert (`O(logS + S)`).- I/O: 1 read `O(S)`, up to 1 mutate `O(S)`. Up to one remove.0- One event.l- The weight of the `call`.M- Storage: inserts one item, value size bounded by `MaxSignatories`, with a deposit taken for its lifetime of `DepositBase + threshold * DepositFactor`.|-------------------------------0- DB Weight:! - Reads: Multisig Storage, [Caller Account], Calls (if `store_call`)% - Writes: Multisig Storage, [Caller Account], Calls (if `store_call`)H- Plus Call Weight,# @approve_as_multi$threshold% u16Dother_signatoriesDVec>$call_hash [u8; 32](max_weight WeightURegister approval for a dispatch to be made from a deterministic composite account ifapproved by a total of `threshold - 1` of `other_signatories`.-Payment: `DepositBase` will be reserved if this is the first approval, plus=`threshold` times `DepositFactor`. It is returned once this dispatch happens or4is cancelled.The dispatch origin for this call must be _Signed_.U- `threshold`: The total number of approvals for this dispatch before it is executed.A- `other_signatories`: The accounts (other than the sender) who can approve thisldispatch. May not be empty.Y- `maybe_timepoint`: If this is the first approval, then this must be `None`. If it isQnot the first approval, then it must be `Some`, with the timepoint (block number andtransaction index) of the first approval transaction.- `call_hash`: The hash of the call to be executed.5NOTE: If this is the final approval, you will want to use `as_multi` instead.(# $- `O(S)`.- Up to one balance-reserve or unreserve operation.=- One passthrough operation, one insert, both `O(S)` where `S` is the number ofE signatories. `S` is capped by `MaxSignatories`, with weight being proportional.- One encode & hash, both of complexity `O(S)`.- Up to one binary search and insert (`O(logS + S)`).- I/O: 1 read `O(S)`, up to 1 mutate `O(S)`. Up to one remove.0- One event.M- Storage: inserts one item, value size bounded by `MaxSignatories`, with a deposit taken for its lifetime of `DepositBase + threshold * DepositFactor`.----------------------------------0- DB Weight: - Read: Multisig Storage, [Caller Account] - Write: Multisig Storage, [Caller Account],# $timepoint-dTimepoint$call_hash [u8; 32]hUCancel a pre-existing, on-going multisig transaction. Any deposit reserved previouslyfor this operation will be unreserved on success.The dispatch origin for this call must be _Signed_.U- `threshold`: The total number of approvals for this dispatch before it is executed.A- `other_signatories`: The accounts (other than the sender) who can approve thisldispatch. May not be empty.]- `timepoint`: The timepoint (block number and transaction index) of the first approvalxtransaction for this dispatch.- `call_hash`: The hash of the call to be executed.(# $- `O(S)`.- Up to one balance-reserve or unreserve operation.=- One passthrough operation, one insert, both `O(S)` where `S` is the number ofE signatories. `S` is capped by `MaxSignatories`, with weight being proportional.- One encode & hash, both of complexity `O(S)`.0- One event.- I/O: 1 read `O(S)`, one remove.p- Storage: removes one item.----------------------------------0- DB Weight: - Read: Multisig Storage, [Caller Account], Refund Account, Calls - Write: Multisig Storage, [Caller Account], Refund Account, Calls,# %Contains one variant per dispatchable that can be called by an extrinsic.OptionT-NoneSome- ,description(Vec0TPropose a new bounty.The dispatch origin for this call must be _Signed_.QPayment: `TipReportDepositBase` will be reserved from the origin account, as well asQ`DataDepositPerByte` for each byte in `reason`. It will be unreserved upon approval,dor slashed when rejected.- `curator`: The curator account whom will manage this bounty.d- `fee`: The curator fee.%- `value`: The total payment amount of this bounty, curator fee included.- `description`: The description of this bounty.8approve_bounty$bounty_id,BountyIndex ]Approve a bounty proposal. At a later time, the bounty will be funded and become activeand the original deposit will be returned.May only be called from `T::ApproveOrigin`.(# - O(1).,# ::Source fee0BalanceOfAssign a curator to a funded bounty.May only be called from `T::ApproveOrigin`.(# - O(1).,# @unassign_curator$bounty_id,BountyIndexH|Unassign curator from a bounty.This function can only be called by the `RejectOrigin` a signed origin.=If this function is called by the `RejectOrigin`, we assume that the curator is1malicious or inactive. As a result, we will slash the curator when possible.aIf the origin is the curator, we take this as a sign they are unable to do their job and]they willingly give up. We could slash them, but for now we allow them to recover their5deposit and exit without issue. (We may want to change this if it is abused.)]Finally, the origin can be anyone if and only if the curator is "inactive". This allowsaanyone in the community to call out that a curator is not doing their due diligence, and9we should pick a new curator. In this case the curator should also be slashed.(# - O(1).,# 8accept_curator$bounty_id,BountyIndex Accept the curator role for a bounty.)A deposit will be reserved from curator and refund upon successful payout.May only be called from the curator.(# - O(1).,# 0award_bounty$bounty_id,BountyIndex,beneficiaryM::Source,YAward bounty to a beneficiary account. The beneficiary will be able to claim the funds8after a delay.The dispatch origin for this call must be the curator of this bounty.- `bounty_id`: Bounty ID to award.- `beneficiary`: The beneficiary account whom will receive the payout.(# - O(1).,# 0claim_bounty$bounty_id,BountyIndex$Claim the payout from an awarded bounty after payout delay.%The dispatch origin for this call must be the beneficiary of this bounty.- `bounty_id`: Bounty ID to claim.(# - O(1).,# 0close_bounty$bounty_id,BountyIndex(9Cancel a proposed or active bounty. All the funds will be sent to treasury andthe curator deposit will be unreserved if possible.Only `T::RejectOrigin` is able to cancel a bounty.- `bounty_id`: Bounty ID to cancel.(# - O(1).,# Pextend_bounty_expiry$bounty_id,BountyIndexremark(Vec(Extend the expiry time of an active bounty.The dispatch origin for this call must be the curator of this bounty.- `bounty_id`: Bounty ID to extend.- `remark`: additional information.(# - O(1).,# %Contains one variant per dispatchable that can be called by an extrinsic. ,pallet_tipspalletCallT8report_awesomereason(Vec who0T::AccountIdLYReport something `reason` that deserves a tip and claim any eventual the finder's fee.The dispatch origin for this call must be _Signed_.QPayment: `TipReportDepositBase` will be reserved from the origin account, as well as`DataDepositPerByte` for each byte in `reason`.]- `reason`: The reason for, or the thing that deserves, the tip; generally this will beX a UTF-8-encoded URL.- `who`: The account which should be credited for the tip.tEmits `NewTip` if successful.(# - Complexity: `O(R)` where `R` length of `reason`. - encoding and hashing of 'reason'p- DbReads: `Reasons`, `Tips`t- DbWrites: `Reasons`, `Tips`,# ,retract_tiphash$T::HashLQRetract a prior tip-report from `report_awesome`, and cancel the process of tipping.If successful, the original deposit will be unreserved.MThe dispatch origin for this call must be _Signed_ and the tip identified by `hash`Amust have been reported by the signing account through `report_awesome` (and notLthrough `tip_new`).a- `hash`: The identity of the open tip for which a tip value is declared. This is formed] as the hash of the tuple of the original tip `reason` and the beneficiary account ID.Emits `TipRetracted` if successful.(# P- Complexity: `O(1)` - Depends on the length of `T::Hash` which is fixed.- DbReads: `Tips`, `origin account`- DbWrites: `Reasons`, `Tips`, `origin account`,# tip_new reason(Vec who0T::AccountId$tip_value0BalanceOfXGive a tip for something new; no finder's fee will be taken.QThe dispatch origin for this call must be _Signed_ and the signing account must be apmember of the `Tippers` set.]- `reason`: The reason for, or the thing that deserves, the tip; generally this will beX a UTF-8-encoded URL.- `who`: The account which should be credited for the tip.M- `tip_value`: The amount of tip that the sender would like to give. The median tip value of active tippers will be given to the `who`.tEmits `NewTip` if successful.(# Q- Complexity: `O(R + T)` where `R` length of `reason`, `T` is the number of tippers.] - `O(T)`: decoding `Tipper` vec of length `T`. `T` is charged as upper bound given by- `ContainsLengthBound`. The actual cost depends on the implementation ofD `T::Tippers`. - `O(R)`: hashing and encoding of reason of length `R`|- DbReads: `Tippers`, `Reasons`t- DbWrites: `Reasons`, `Tips`,# tiphash$T::Hash$tip_value0BalanceOf`Declare a tip value for an already-open tip.QThe dispatch origin for this call must be _Signed_ and the signing account must be apmember of the `Tippers` set.a- `hash`: The identity of the open tip for which a tip value is declared. This is formed] as the hash of the tuple of the hash of the original tip `reason` and the beneficiary4 account ID.M- `tip_value`: The amount of tip that the sender would like to give. The median tip value of active tippers will be given to the `who`.aEmits `TipClosing` if the threshold of tippers has been reached and the countdown period0has started.(# a- Complexity: `O(T)` where `T` is the number of tippers. decoding `Tipper` vec of length- `T`, insert tip and check closing, `T` is charged as upper bound given by] `ContainsLengthBound`. The actual cost depends on the implementation of `T::Tippers`.] Actually weight could be lower as it depends on how many tips are in `OpenTip` but it is weighted as if almost full i.e of length `T-1`.p- DbReads: `Tippers`, `Tips`H- DbWrites: `Tips`,# $close_tiphash$T::Hash@\Close and payout a tip.The dispatch origin for this call must be _Signed_.The tip identified by `hash` must have finished its countdown period.a- `hash`: The identity of the open tip for which a tip value is declared. This is formed] as the hash of the tuple of the original tip `reason` and the beneficiary account ID.(# a- Complexity: `O(T)` where `T` is the number of tippers. decoding `Tipper` vec of lengthQ `T`. `T` is charged as upper bound given by `ContainsLengthBound`. The actual cost depends on the implementation of `T::Tippers`.- DbReads: `Tips`, `Tippers`, `tip finder`- DbWrites: `Reasons`, `Tips`, `Tippers`, `tip finder`,# $slash_tiphash$T::Hash0Remove and slash an already-open tip.May only be called from `T::RejectOrigin`.As a result, the finder is slashed and the deposits are lost.Emits `TipSlashed` if successful.(# `T` is charged as upper bound given by `ContainsLengthBound`. The actual cost depends on the implementation of `T::Tippers`.,# %Contains one variant per dispatchable that can be called by an extrinsic. pallet_election_provider_multi_phasepalletCallT>>witnessXSolutionOrSnapshotSize8Submit a solution for the unsigned phase.The dispatch origin fo this call must be __none__.=This submission is checked on the fly. Moreover, this unsigned solution is onlyUvalidated when submitted to the pool from the **local** node. Effectively, this means]that only active validators can submit this transaction when authoring a block (similar@to an inherent).YTo prevent any incorrect solution (and thus wasted time/weight), this transaction willMpanic if the solution submitted by the validator is invalid in any way, effectivelyputting their authoring reward at risk.No deposit or reward is associated with this submission.lset_minimum_untrusted_score@maybe_next_scoreTOptionSet a new value for `MinimumUntrustedScore`.Dispatch origin must be aligned with `T::ForceOrigin`.This check can be turned off by setting the value to `None`.tset_emergency_election_result supportsXSupports YSet a solution in the queue, to be handed out to the client of this pallet in the nextcall to `ElectionProvider::elect`.EThis can only be set by `T::ForceOrigin`, and only when the phase is `Emergency`.aThe solution is not checked for any feasibility and is assumed to be trustworthy, as anyQfeasibility check itself can in principle cause the election process to fail (due tohmemory/weight constrains).submit0raw_solution|Box>>Xnum_signed_submissions u324Submit a solution for the signed phase.The dispatch origin fo this call must be __signed__.]The solution is potentially queued, based on the claimed score and processed at the endPof the signed phase.]A deposit is reserved and recorded for the solution. Based on the outcome, the solutionmight be rewarded, slashed, or get all or a part of the deposit back.(# Queue size must be provided as witness data.,# %Contains one variant per dispatchable that can be called by an extrinsic.pallet_election_provider_multi_phase,RawSolutionS  solutionSscore4ElectionScoreround u32@polkadot_runtimeTNposCompactSolution16@votes1votes2votes3votes4%votes51votes6=votes7Ivotes8Uvotes9avotes10mvotes11yvotes12votes13votes14votes15votes16%      4sp_arithmetic(per_thingsPerU16% u16 !! %)) -- 155 99 =AA EE IMM QQ UYY ]] aee ii mqq uu y}}            pallet_election_provider_multi_phaseXSolutionOrSnapshotSizevoters u32targets u32OptionTNoneSomeDsp_npos_electionsSupport$AccountIdtotallpolkadot_runtime_parachains4configurationpalletCallTset_validation_upgrade_frequency new8T::BlockNumberSet the validation upgrade frequency.pset_validation_upgrade_delay new8T::BlockNumberSet the validation upgrade delay.dset_code_retention_period new8T::BlockNumberSet the acceptance period for an included candidate.Dset_max_code_size new u32Set the max validation code size for incoming upgrades.@set_max_pov_size new u32Set the max POV block size for incoming upgrades.Xset_max_head_data_size new u32Set the max head data size for paras.Pset_parathread_cores new u32Set the number of parathread execution cores.Xset_parathread_retries new u32Set the number of retries for a particular parathread.pset_group_rotation_frequency new8T::BlockNumberSet the parachain validator-group rotation frequencytset_chain_availability_period new8T::BlockNumber Set the availability period for parachains.xset_thread_availability_period new8T::BlockNumber Set the availability period for parathreads.`set_scheduling_lookahead new u32 9Set the scheduling lookahead, in expected number of blocks at peak throughput.lset_max_validators_per_core newy,Option Set the maximum number of validators to assign to any core.Hset_max_validators newy,Option  Set the maximum number of validators to use in parachain consensus.Hset_dispute_period new0SessionIndex Set the dispute period, in number of sessions to keep for disputes.set_dispute_post_conclusion_acceptance_period new8T::BlockNumberSet the dispute post conclusion acceptance period.hset_dispute_max_spam_slots new u32Set the maximum number of dispute spam slots.set_dispute_conclusion_by_time_out_period new8T::BlockNumberSet the dispute conclusion by time out period.Dset_no_show_slots new u32Set the no show slots, in number of number of consensus slots.LMust be at least 1.Pset_n_delay_tranches new u32Set the total number of delay tranches.xset_zeroth_delay_tranche_width new u32Set the zeroth delay tranche width.Pset_needed_approvals new u32Set the number of validators needed to approve a block.pset_relay_vrf_modulo_samples new u32YSet the number of samples to do of the `RelayVRFModulo` approval assignment criterion.hset_max_upward_queue_count new u32-Sets the maximum items that can present in a upward dispatch queue at once.dset_max_upward_queue_size new u32eSets the maximum total size of items that can present in a upward dispatch queue at once.tset_max_downward_message_size new u32Set the critical downward message size.pset_ump_service_total_weight new Weight9Sets the soft limit for the phase of dispatching dispatchable upward messages.lset_max_upward_message_size new u32-Sets the maximum size of an upward message that can be sent by a candidate.set_max_upward_message_num_per_candidate new u32Sets the maximum number of messages that a candidate can contain.dset_hrmp_open_request_ttl new u325Sets the number of sessions after which an HRMP open channel request expires.\set_hrmp_sender_deposit newBalanceQSets the amount of funds that the sender should provide for opening an HRMP channel.hset_hrmp_recipient_deposit newBalanceaSets the amount of funds that the recipient should provide for accepting opening an HRMP channel.tset_hrmp_channel_max_capacity new u32 Sets the maximum number of messages allowed in an HRMP channel at once.|set_hrmp_channel_max_total_size new u32!QSets the maximum total size of messages in bytes allowed in an HRMP channel at once.set_hrmp_max_parachain_inbound_channels new u32"ISets the maximum number of inbound HRMP channels a parachain is allowed to accept.set_hrmp_max_parathread_inbound_channels new u32#MSets the maximum number of inbound HRMP channels a parathread is allowed to accept.set_hrmp_channel_max_message_size new u32$=Sets the maximum size of a message that could ever be put into an HRMP channel.set_hrmp_max_parachain_outbound_channels new u32%ESets the maximum number of outbound HRMP channels a parachain is allowed to open.set_hrmp_max_parathread_outbound_channels new u32&ISets the maximum number of outbound HRMP channels a parathread is allowed to open.set_hrmp_max_message_num_per_candidate new u32'5Sets the maximum number of outbound HRMP messages can be sent by a candidate.tset_ump_max_individual_weight new Weight(1Sets the maximum amount of weight any individual upward message may consume.%Contains one variant per dispatchable that can be called by an extrinsic.lpolkadot_runtime_parachainssharedpalletCallT%Contains one variant per dispatchable that can be called by an extrinsic.lpolkadot_runtime_parachains$inclusionpalletCallT%Contains one variant per dispatchable that can be called by an extrinsic.lpolkadot_runtime_parachains8paras_inherentpalletCallTenterdataParachainsInherentData1Enter the paras inherent. This will process bitfields and backed candidates.%Contains one variant per dispatchable that can be called by an extrinsic. Lpolkadot_primitivesv10InherentData HDR$bitfieldsUncheckedSignedAvailabilityBitfieldsDbacked_candidates |Vec> disputes1`MultiDisputeStatementSet4parent_header HDRLpolkadot_primitivesv1signed bitvecorderLsb0 Lpolkadot_primitivesv08ValidatorIndex u32Lpolkadot_primitivesv04validator_app$Signature]Hsr25519::Signature    Lpolkadot_primitivesv18validity_votes)`VecDvalidator_indices|BitVec Lpolkadot_primitivesv1dCommittedCandidateReceiptH$(descriptorMXCandidateDescriptor,commitmentsPCandidateCommitments Lpolkadot_primitivesv1PCandidateCommitmentsNLhorizontal_messagespVec>Lnew_validation_code!XOption$head_datai HeadDatalprocessed_downward_messages u328hrmp_watermarkN`polkadot_core_primitivesLOutboundHrmpMessageIdQ$recipientQIddata(Psp_std::vec::Vec!OptionT%NoneSome%% Hpolkadot_parachain(primitives8ValidationCode(Vec)-- Lpolkadot_primitivesv0LValidityAttestation ImplicitHValidatorSignature ExplicitHValidatorSignature155 Lpolkadot_primitivesv1LDisputeStatementSet 8candidate_hash94CandidateHashsession0SessionIndex(statements=Vec<(DisputeStatement, ValidatorIndex, ValidatorSignature)>9`polkadot_core_primitives4CandidateHash$Hash=AA EE Lpolkadot_primitivesv1@DisputeStatementValidIdValidDisputeStatementKindInvalidMlInvalidDisputeStatementKindI Lpolkadot_primitivesv1dValidDisputeStatementKind ExplicitidQParaId0genesis_headi HeadData0period_begin@LeasePeriodOf0period_count@LeasePeriodOfiJust a connect into the `lease_out` call, in case Root wants to force some lease to happenindependently of any other on-chain mechanism to use it.Can only be called by the Root origin.@clear_all_leasesparaQParaId MClear all leases for a Para Id, refunding any deposits back to the original owners.Can only be called by the Root origin.TCreate a new auction.QThis can only happen when there isn't already an auction in progress and may only be%called by the root origin. Accepts the `duration` of this auction and theY`lease_period_index` of the initial lease period of the four that are to be auctioned. bidparaqParaId4auction_index0AuctionIndex(first_slot@LeasePeriodOf$last_slot@LeasePeriodOfamount0BalanceOf@IMake a new bid from an account (including a parachain account) for deploying a new(parachain.YMultiple simultaneous bids from the same bidder are allowed only as long as all active=bids overlap each other (i.e. are mutually exclusive). Bids cannot be redacted.U- `sub` is the sub-bidder ID, allowing for multiple competing bids to be made by (andpfunded by) the same account.M- `auction_index` is the index of the auction to bid on. Should just be the presenthvalue of `AuctionCounter`.I- `first_slot` is the first lease period index of the range to bid on. This is the absolute lease period index value, not an auction-specific offset.A- `last_slot` is the last lease period index of the range to bid on. This is the absolute lease period index value, not an auction-specific offset.I- `amount` is the amount to bid to be held as deposit for the parachain should thebid win. This amount is held throughout the range.8cancel_auction xCancel an in-progress auction.Can only be called by Root origin.%Contains one variant per dispatchable that can be called by an extrinsic.qQu\polkadot_runtime_common$crowdloanpalletCallT createindexqParaId cap0BalanceOf0first_period@LeasePeriodOf,last_period@LeasePeriodOf end8T::BlockNumber verifieryLOptioniCreate a new crowdloaning campaign for a parachain slot with the given lease period range.]This applies a lock to your parachain configuration, ensuring that it cannot be changeddby the parachain manager.(contribute indexqParaIdvalue0BalanceOf$signatureXOptionQContribute to a crowd sale. This will transfer some balance over to fund a parachainQslot. It will be withdrawable when the crowdloan has ended and the funds are unused. withdraw who0T::AccountIdindexqParaIdDWithdraw full balance of a specific contributor.Origin must be signed, but can come from anyone.The fund must be either in, or ready for, retirement. For a fund to be *in* retirement, then the retirementflag must be set. For a fund to be ready for retirement, then:- it must not already be in retirement;M- the amount of raised funds must be bigger than the _free_ balance of the account;4- and either: - the block number must be at least `end`; or- - the current lease period must be greater than the fund's `last_period`.mIn this case, the fund's retirement flag is set and its `end` is reset to the current blocknumber.- `who`: The account whose contribution should be withdrawn.- `index`: The parachain to whose crowdloan the contribution was made.refundindexqParaIdAutomatically refund contributors of an ended crowdloan.!Due to weight restrictions, this function may need to be called multipleItimes to fully refund all users. We will refund `RemoveKeysLimit` users at a time.Origin must be signed, but can come from anyone. dissolveindexqParaIdURemove a fund after the retirement period has ended and all funds have been returned.editindexqParaId cap0BalanceOf0first_period@LeasePeriodOf,last_period@LeasePeriodOf end8T::BlockNumber verifieryLOption Edit the configuration for an in-progress crowdloan.Can only be called by Root origin. add_memoindexQParaIdmemo(Vec Add an optional memo to an existing crowdloan contribution.-Origin must be Signed, and the user must have contributed to the crowdloan.pokeindexQParaId tPoke the fund into `NewRaise`Origin must be Signed, and the fund has non-zero raise.%Contains one variant per dispatchable that can be called by an extrinsic.yOptionT}NoneSome}}(sp_runtime,MultiSigner Ed25519Councilpallet_collective::OriginHTechnicalCommitteepallet_collective::Origin@ParachainsOrigindparachains_origin::Origin2Voidself::sp_api_hidden_includes_construct_runtime::hidden_include::Void0frame_system$RawOrigin$AccountId RootSigned$AccountIdNoneDpallet_collective$RawOrigin$AccountIdI Members,MemberCount,MemberCountMember$AccountId _PhantomDpallet_collective$RawOrigin$AccountIdI Members,MemberCount,MemberCountMember$AccountId _Phantomlpolkadot_runtime_parachainsoriginpalletOrigin$ParachainQParaIdsp_coreVoid@pallet_scheduler ReleasesV1V2 @pallet_schedulerpalletErrorT@FailedToScheduledFailed to schedule a call NotFound|Cannot find the scheduled call.\TargetBlockNumberInPastGiven target block number is in the past.HRescheduleNoChangeReschedule failed because it does not change scheduled time. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. 4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTSVec% 4frame_supportstorage,bounded_vec(BoundedVecTSVecOptionTNoneSomeDsp_consensus_babeXBabeEpochConfigurationc5((u64, u64)4allowed_slots90AllowedSlots ,pallet_babepalletErrorT `InvalidEquivocationProof1An equivocation proof provided as part of an equivocation report is invalid.`InvalidKeyOwnershipProof1A key ownership proof provided as part of an equivocation report is invalid.XDuplicateOffenceReportA given equivocation report is valid but already previously reported. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet.   8pallet_indicespalletErrorT,NotAssignedThe index was not already assigned. NotOwnerThe index is assigned to another account.InUsepThe index was not available.,NotTransferThe source and destination accounts are identical.$PermanentThe index is permanent and may not be freed/changed. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. 4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTSVec Dpallet_authorshippalletErrorTHInvalidUncleParentThe uncle parent not in the chain.@UnclesAlreadySetUncles already set in the block.4TooManyUncles@Too many uncles.0GenesisUncleTThe uncle is genesis.0TooHighUncle|The uncle is too high in chain.PUncleAlreadyIncludedxThe uncle is already included. OldUncleThe uncle isn't recent enough to be included. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. 8pallet_staking4StakingLedger$AccountIdBalancestash$AccountIdtotalBalanceactiveBalance$unlocking!dVec>!%%8pallet_staking,UnlockChunkBalancevalueBalance era EraIndex)8pallet_staking,Nominations$AccountId targets8Vec0submitted_in EraIndex(suppressedbool-8pallet_staking4ActiveEraInfoindex EraIndexstart,Option158pallet_staking9 BTreeMapKV==AAE8pallet_stakingForcing(NotForcing ForceNew$ForceNone,ForceAlwaysIMM8pallet_staking8UnappliedSlash$AccountIdBalance$validator$AccountId ownBalanceothersdVec<(AccountId, Balance)>$reporters8VecpayoutBalanceQU 8pallet_staking slashing4SlashingSpans(span_index$SpanIndex(last_start EraIndexHlast_nonzero_slash EraIndexprioru4VecY 8pallet_staking slashing(SpanRecordBalanceslashedBalance paid_outBalance]8pallet_staking Releases 4V1_0_0AncientV2_0_0V3_0_0V4_0_0V5_0_0V6_0_0V7_0_0V8_0_0a8pallet_stakingpalletpalletErrorT\4NotControllerdNot a controller account. NotStashPNot a stash account.4AlreadyBonded`Stash is already bonded.4AlreadyPairedtController is already paired.0EmptyTargets`Targets cannot be empty.8DuplicateIndex@Duplicate index.DInvalidSlashIndexSlash record index out of bounds.@InsufficientBondCan not bond with value less than minimum required.0NoMoreChunksCan not schedule more unlock chunks.4NoUnlockChunk Can not rebond without unlocking chunks.0FundedTarget Attempting to target a stash that still has funds.HInvalidEraToReward XInvalid era to reward.hInvalidNumberOfNominations xInvalid number of nominations.HNotSortedAndUnique Items are not sorted and unique.8AlreadyClaimed Rewards for this era have already been claimed for this validator.TIncorrectHistoryDepthIncorrect previous history depth input provided.XIncorrectSlashingSpansIncorrect number of slashing spans provided. BadState9Internal state has become somehow corrupted and the operation cannot continue.8TooManyTargetsToo many nomination targets supplied.$BadTarget=A nomination target was supplied that was blocked or otherwise not a validator.@CannotChillOtherUThe user has enough bond and thus cannot be chilled forcefully by an external person.DTooManyNominatorsMThere are too many nominators in the system. Governance needs to adjust the stakingsettings to keep things safe for the runtime.DTooManyValidatorsMThere are too many validators in the system. Governance needs to adjust the stakingsettings to keep things safe for the runtime. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. e (sp_stakingoffence8OffenceDetails Reporter Offender offender Offender$reporters4Veci(mqquy(y sp_corecrypto$KeyTypeId8[u8; 4]} 8pallet_sessionpalletErrorT0InvalidProof`Invalid ownership proof.\NoAssociatedValidatorIdNo associated validator ID for account.4DuplicatedKeydRegistered duplicate key.NoKeysNo keys are associated with this account.$NoAccountKey setting account is not live, so it's impossible to associate keys.tError for the session pallet.8pallet_grandpa,StoredStateNLive0PendingPause0scheduled_atNdelayNPaused4PendingResume0scheduled_atNdelayN8pallet_grandpaLStoredPendingChangeNLimit0scheduled_atNdelayN@next_authoritieslBoundedAuthorityListforcedy$Option4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTSVec 8pallet_grandpapalletErrorT,PauseFailedAttempt to signal GRANDPA pause when the authority set isn't live(either paused or already pending pause).0ResumeFailedAttempt to signal GRANDPA resume when the authority set isn't paused(either live or already pending resume).4ChangePendingAttempt to signal GRANDPA change with one already pending.TooSoonCannot signal forced change so soon after last.`InvalidKeyOwnershipProof1A key ownership proof provided as part of an equivocation report is invalid.`InvalidEquivocationProof1An equivocation proof provided as part of an equivocation report is invalid.XDuplicateOffenceReportA given equivocation report is valid but already previously reported. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. 4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTSVec4frame_supporttraitsmisc4WrapperOpaqueTT@pallet_im_onlinedBoundedOpaqueNetworkState LPeerIdEncodingLimitXMultiAddrEncodingLimit8AddressesLimitpeer_idWeakBoundedVecHexternal_addresses-WeakBoundedVec, AddressesLimit >4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTS(Vec4frame_supportstorage@weak_bounded_vec8WeakBoundedVecTSVec @pallet_im_onlinepalletErrorT(InvalidKey`Non existent public key.LDuplicatedHeartbeatTDuplicated heartbeat. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet.  $@pallet_democracy8PreimageStatus $AccountIdBalance,BlockNumberMissing,BlockNumber$Availabledata(Vec provider$AccountIddepositBalancesince,BlockNumberexpiryyLOption @pallet_democracytypes8ReferendumInfo ,BlockNumberHash$BalanceOngoingReferendumStatus Finished approvedbool end,BlockNumber @pallet_democracytypes@ReferendumStatus ,BlockNumberHash$Balance end,BlockNumber4proposal_hash$Hash$threshold4VoteThresholddelay,BlockNumbertally8Tally @pallet_democracytypesTallyBalance ayesBalancenaysBalanceturnoutBalance @pallet_democracyvoteVoting Balance$AccountId,BlockNumberDirect votesVec<(ReferendumIndex, AccountVote)>,delegationsPDelegationsprior|PriorLock(DelegatingbalanceBalancetarget$AccountId(conviction(Conviction,delegationsPDelegationsprior|PriorLock @pallet_democracytypes,DelegationsBalancevotesBalancecapitalBalance @pallet_democracyvote$PriorLock,BlockNumberBalance,BlockNumberBalance$@pallet_democracy ReleasesV1 @pallet_democracypalletErrorTp ValueLow4Value too lowDpallet_collectiveVotes$AccountId,BlockNumberindex4ProposalIndex$threshold,MemberCountayes8Vecnays8Vec end,BlockNumber Dpallet_collectivepalletErrorTI($NotMember\Account is not a memberDDuplicateProposal|Duplicate proposals not allowed Dpallet_collectivepalletErrorTI($NotMember\Account is not a memberDDuplicateProposal|Duplicate proposals not allowedstakeBalancedepositBalance dpallet_elections_phragmenpalletErrorTD0UnableToVoteCannot vote when no candidates or members exist.NoVotesMust vote for at least one candidate.0TooManyVotesCannot vote more than candidates.PMaximumVotesExceededCannot vote more than maximum allowed.(LowBalanceCannot vote with stake less than minimum balance.! 4sp_arithmetic(per_thingsPermill u32%4frame_support PalletId[u8; 8]) 5)98pallet_vesting ReleasesV0V1= 8pallet_vestingpalletErrorT(NotVestingThe account given is not vesting.TAtMaxVestingSchedules%The account already has `MaxVestingSchedules` count of schedules and thusQcannot add another one. Consider merging existing schedules in order to add another.$AmountLowAmount being transferred is too low to create a vesting schedule.`ScheduleIndexOutOfBoundsAn index was out of bounds of the vesting schedules.TInvalidScheduleParams Failed to create a new schedule because some parameter was invalid.tError for the vesting pallet.A 8pallet_utilitypalletErrorT0TooManyCalls\Too many calls batched. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. E ), MaxJudgements>depositBalanceinfo9IdentityInfoI4frame_supportstorage,bounded_vec(BoundedVecTMSQVecMQMUYY4frame_supportstorage,bounded_vec(BoundedVecTSVec]4frame_supportstorage,bounded_vec(BoundedVecTaSiVecaOptionTeNoneSomeee y0pallet_proxy0pallet_proxy0Announcement $AccountIdHash$,BlockNumber real$AccountId$call_hash$Hashheight,BlockNumber 0pallet_proxypalletErrorT TooMany!There are too many proxies registered or too many announcements pending. NotFoundtProxy registration not found. NotProxySender is not a proxy of the account to be proxied.,Unproxyable!A call which is incompatible with the proxy type's filter was attempted.$DuplicatelAccount is already a proxy.0NoPermissionCall may not be made by proxy because it may escalate its privileges.,UnannouncedAnnouncement, if made at all, was made too recently.,NoSelfProxydCannot add self as proxy. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. depositBalance$depositor$AccountId$approvals8Vec ( tipsdVec<(AccountId, Balance)>,finders_feebool ,pallet_tipspalletErrorT0ReasonTooBigThe reason given is just too big.0AlreadyKnownThe tip was already found/started.(UnknownTip`The tip hash is unknown.$NotFinderThe account attempting to retract the tip is not the finder of the tip.$StillOpen)The tip cannot be claimed/closed because there are not enough tippers yet.$Premature1The tip cannot be claimed/closed because it's still in the countdown period. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet. pallet_election_provider_multi_phasePhaseBn OffSigned Unsigned((bool, Bn)$Emergencypallet_election_provider_multi_phase4ReadySolutionA  supports,Supportsscore4ElectionScorecompute=)>targetsVec 4frame_supportstorageDbounded_btree_map BTreeMapKV pallet_election_provider_multi_phasesigned@SignedSubmission $AccountIdBalance Solution who$AccountIddepositBalance0raw_solutionTRawSolutionrewardBalance pallet_election_provider_multi_phasepalletErrorT,hPreDispatchEarlySubmissiondSubmission was too early.lPreDispatchWrongWinnerCountWrong number of winners presented.dPreDispatchWeakSubmissionSubmission was too weak, score-wise.8max_validatorsy,Option8dispute_period0SessionIndexdispute_post_conclusion_acceptance_period,BlockNumberXdispute_max_spam_slots u32dispute_conclusion_by_time_out_period,BlockNumber4no_show_slots u32@n_delay_tranches u32hzeroth_delay_tranche_width u32@needed_approvals u32`relay_vrf_modulo_samples u32dump_max_individual_weight Weightlpolkadot_runtime_parachains4configurationpalletErrorTHavailability_votes`BitVecbackers`BitVecLrelay_parent_numberN@backed_in_numberN4backing_groupq(GroupIndexlpolkadot_runtime_parachains$inclusionpalletErrorT\DWrongBitfieldSizeAvailability bitfield has unexpected size.pBitfieldDuplicateOrUnorderedMMultiple bitfields submitted by same validator or validators out of order by index.dValidatorIndexOutOfBoundsxValidator index out of bounds.`InvalidBitfieldSignatureDInvalid signaturePUnscheduledCandidateCandidate submitted but para not scheduled.CandidateScheduledBeforeParaFree1Candidate scheduled despite pending candidate already existing for the para.4WrongCollatorCandidate included with the wrong collator.LScheduledOutOfOrdertScheduled cores out of order.@HeadDataTooLargeHead data exceeds the configured maximum.PPrematureCodeUpgrade dCode upgrade prematurely.@next_core_offset u32 lpolkadot_runtime_parachains$scheduler@QueuedParathreadclaim>,last_prunedy$OptionIMM lpolkadot_runtime_parachainsparas@ReplacementTimesN,expected_atN0activated_atNQAU Lpolkadot_primitivesv18UpgradeGoAheadAbortGoAheadY Lpolkadot_primitivesv1HUpgradeRestrictionPresent] lpolkadot_runtime_parachainsparasqueued@Vec4session_index0SessionIndexmqq`polkadot_core_primitivesXInboundDownwardMessage,BlockNumbersent_at,BlockNumber msg(8sender_depositBalanceDrecipient_depositBalanceOptionT$NoneSome$`polkadot_core_primitivesHInboundHrmpMessage,BlockNumbersent_at,BlockNumberdata(Psp_std::vec::Vec-lpolkadot_runtime_parachainshrmppalletErrorTHTOpenHrmpChannelToSelfThe sender tried to open a channel to themselves.|OpenHrmpChannelInvalidRecipientThe recipient is not a valid para.lOpenHrmpChannelZeroCapacity|The requested capacity is zero.OpenHrmpChannelCapacityExceedsLimitThe requested capacity exceeds the global limit.xOpenHrmpChannelZeroMessageSizeThe requested maximum message size is 0.OpenHrmpChannelMessageSizeExceedsLimit)The open request requested the message size that exceeds the global limit.pOpenHrmpChannelAlreadyExistshThe channel already exists|OpenHrmpChannelAlreadyRequestedThere is already a request to open the same channel.pOpenHrmpChannelLimitExceededThe sender already has the maximum number of allowed outbound channels.pAcceptHrmpChannelDoesntExist The channel from the sender to the origin doesn't exist.AcceptHrmpChannelAlreadyConfirmed The channel is already confirmed.xAcceptHrmpChannelLimitExceeded %The recipient already has the maximum number of allowed inbound channels.pCloseHrmpChannelUnauthorized UThe origin tries to close a channel where it is neither the sender nor the recipient.lCloseHrmpChannelDoesntExist The channel to be closed doesn't exist.|CloseHrmpChannelAlreadyUnderwayThe channel close request is already requested.CancelHrmpOpenChannelUnauthorized]Canceling is requested by neither the sender nor recipient of the open channel request.hOpenHrmpChannelDoesntExist|The open request doesn't exist.|OpenHrmpChannelAlreadyConfirmed-Cannot cancel an HRMP open channel request because it is already confirmed. Custom [dispatch errors](https://substrate.dev/docs/en/knowledgebase/runtime/errors) of this pallet.  Lpolkadot_primitivesv1,SessionInfo((validators@Vec8discovery_keysdVec@validator_groups `Vec>n_cores u32hzeroth_delay_tranche_width u32`relay_vrf_modulo_samples u32@n_delay_tranches u324no_show_slots u32@needed_approvals u32 \polkadot_runtime_commondepositBalanceraisedBalance end,BlockNumber capBalanceDlast_contributiontLastContribution0first_period,LeasePeriod,last_period,LeasePeriod(trie_index$TrieIndex \polkadot_runtime_common$crowdloan@LastContribution,BlockNumber Never$PreEnding u32Ending,BlockNumber\polkadot_runtime_common$crowdloanpalletErrorT\DFirstPeriodInPastThe current lease period is more than the first lease period.dFirstPeriodTooFarInFutureThe first lease period needs to at least be less than 3 `max_value`.lLastPeriodBeforeFirstPeriodLast lease period must be greater than first lease period.`LastPeriodTooFarInFuture-The last lease period cannot be more than 3 periods after the first period. Mortal63? Mortal64@ Mortal65A Mortal66B Mortal67C Mortal68D Mortal69E Mortal70F Mortal71G Mortal72H Mortal73I Mortal74J Mortal75K Mortal76L Mortal77M Mortal78N Mortal79O Mortal80P Mortal81Q Mortal82R Mortal83S Mortal84T Mortal85U Mortal86V Mortal87W Mortal88X Mortal89Y Mortal90Z Mortal91[ Mortal92\ Mortal93] Mortal94^ Mortal95_ Mortal96` Mortal97a Mortal98b Mortal99c$Mortal100d$Mortal101e$Mortal102f$Mortal103g$Mortal104h$Mortal105i$Mortal106j$Mortal107k$Mortal108l$Mortal109m$Mortal110n$Mortal111o$Mortal112p$Mortal113q$Mortal114r$Mortal115s$Mortal116t$Mortal117u$Mortal118v$Mortal119w$Mortal120x$Mortal121y$Mortal122z$Mortal123{$Mortal124|$Mortal125}$Mortal126~$Mortal127$Mortal128$Mortal129$Mortal130$Mortal131$Mortal132$Mortal133$Mortal134$Mortal135$Mortal136$Mortal137$Mortal138$Mortal139$Mortal140$Mortal141$Mortal142$Mortal143$Mortal144$Mortal145$Mortal146$Mortal147$Mortal148$Mortal149$Mortal150$Mortal151$Mortal152$Mortal153$Mortal154$Mortal155$Mortal156$Mortal157$Mortal158$Mortal159$Mortal160$Mortal161$Mortal162$Mortal163$Mortal164$Mortal165$Mortal166$Mortal167$Mortal168$Mortal169$Mortal170$Mortal171$Mortal172$Mortal173$Mortal174$Mortal175$Mortal176$Mortal177$Mortal178$Mortal179$Mortal180$Mortal181$Mortal182$Mortal183$Mortal184$Mortal185$Mortal186$Mortal187$Mortal188$Mortal189$Mortal190$Mortal191$Mortal192$Mortal193$Mortal194$Mortal195$Mortal196$Mortal197$Mortal198$Mortal199$Mortal200$Mortal201$Mortal202$Mortal203$Mortal204$Mortal205$Mortal206$Mortal207$Mortal208$Mortal209$Mortal210$Mortal211$Mortal212$Mortal213$Mortal214$Mortal215$Mortal216$Mortal217$Mortal218$Mortal219$Mortal220$Mortal221$Mortal222$Mortal223$Mortal224$Mortal225$Mortal226$Mortal227$Mortal228$Mortal229$Mortal230$Mortal231$Mortal232$Mortal233$Mortal234$Mortal235$Mortal236$Mortal237$Mortal238$Mortal239$Mortal240$Mortal241$Mortal242$Mortal243$Mortal244$Mortal245$Mortal246$Mortal247$Mortal248$Mortal249$Mortal250$Mortal251$Mortal252$Mortal253$Mortal254$Mortal2550frame_system(extensions,check_nonce(CheckNonceT T::Index 0frame_system(extensions0check_weight,CheckWeightT hpallet_transaction_payment`ChargeTransactionPaymentT0BalanceOf \polkadot_runtime_commonclaimsHPrevalidateAttestsT @polkadot_runtimeRuntimeSystemSystem@Account A The full account information for a particular account ID.8ExtrinsicCount Total extrinsics count for the current block.,BlockWeight` The current weight for the block.@AllExtrinsicsLenA Total length (in bytes) for all extrinsics put together, for the current block.$BlockHash$ Map of block numbers to block hashes.4ExtrinsicData(= Extrinsics data for the current block (maps an extrinsic's index to its data).Number  The current block number being processed. Set by `execute_block`.(ParentHash$p Hash of the previous block.Digest, Digest of the current block, also part of the block header.EventsH Events deposited for the current block.Y NOTE: This storage item is explicitly unbounded since it is never intended to be readd from within the runtime.(EventCount The number of events in the `Events` list.,EventTopics$(% Mapping between a topic (represented by T::Hash) and a vector of indexes of events in the `>` list.Q All topic vectors have deterministic storage locations depending on the topic. ThisE allows light-clients to leverage the changes trie storage tracking mechanism and in case of changes fetch the list of events of interest.M The value has the type `(T::BlockNumber, EventIndex)` because if we used only justM the `EventIndex` then in case if the topic has the same contents on the next block no notification will be triggered thus the event might be lost.HLastRuntimeUpgradeU Stores the `spec_version` and `spec_name` of when the last runtime upgrade happened.TUpgradedToU32RefCountM True if we have upgraded so that `type RefCount` is `u32`. False (default) if not.`UpgradedToTripleRefCount] True if we have upgraded so that AccountInfo contains three types of `RefCount`. FalseH (default) if not.8ExecutionPhase The execution phase of the block.T0BlockWeights* J@YsvlX>]@Ys JRjt@Ys Block & extrinsics weights: base values and limits.,BlockLength0<PP The maximum length of a block (in bytes).8BlockHashCount` U Maximum number of block number to block hash mappings to keep (oldest pruned first). DbWeight@@x}  The weight of runtime database operations the runtime can invoke.VersionI polkadotm=IT XŬ^%#hzJ<r)O[?7ȻP Get the chain's current version.(SS58Prefix% The designated SS85 prefix of this chain.9 This replaces the "ss58Format" property declared in the chain spec. Reason is1 that the runtime should know about the prefix in order to make use of it asp an identifier of the chain.$Scheduler$Scheduler AgendaM Items to be executed, indexed by the block number that they should be executed on.Lookup(t Lookup from identity to the block number and index of the task.8StorageVersion | Storage version of the pallet. New networks start with last version. p4MaximumWeight ntE The maximum weight that may be scheduled per block for any dispatchables of less priority than `schedule::HARD_DEADLINE`.PMaxScheduledPerBlock2 The maximum number of scheduled calls in the queue for a single block. Not strictly enforced, but used for weight estimation.BabeBabe@(EpochIndex T Current epoch index.,Authoritiesl Current epoch authorities.,GenesisSlot)  The slot at which the first epoch actually started. This is 0 until the first block of the chain.,CurrentSlot) T Current slot number.(Randomness( The epoch randomness for the *current* epoch., # Security This MUST NOT be used for gambling, as it can be influenced by a malicious validator in the short term. It MAY be used in many cryptographic protocols, however, so long as one remembers that this (like everything else on-chain) it is public. For example, it can be used where a number is needed that cannot have been chosen by an  adversary, for purposes such as public-coin zero-knowledge proofs.`PendingEpochConfigChange1a Pending epoch configuration change that will be applied when the next epoch is enacted.8NextRandomness\ Next epoch randomness. current_era - history_depth` must be0 guaranteed.8ValidatorCount The ideal number of staking participants.TMinimumValidatorCountA Minimum number of staking participants before emergency conditions are imposed.4Invulnerables Y Any validators that may never be slashed or forcibly kicked. It's a Vec since they'reM easy to initialize and the performance hit is minimal (we expect no more than four invulnerables) and restricted to testnets.Bonded Map from all locked "stash" accounts to the controller account.@MinNominatorBond@! The minimum active bond to become and maintain the role of a nominator.@MinValidatorBond@! The minimum active bond to become and maintain the role of a validator.LedgerE Map from all (unlocked) "controller" accounts to the info regarding the staking.Payeea Where the reward payment should be made. Keyed by stash.(Validatorse E The map from (wannabe) validator stash key to the preferences of that validator.I When updating this storage item, you must also update the `CounterForValidators`.PCounterForValidators! A tracker to keep count of the number of items in the `Validators` map.HMaxValidatorsCount 1 The maximum validator count before we stop allowing new validators to join. When this value is not set, no limits are enforced.(Nominators) e The map from nominator stash key to the set of stash keys of all validators to nominate.I When updating this storage item, you must also update the `CounterForNominators`.PCounterForNominators! A tracker to keep count of the number of items in the `Nominators` map.HMaxNominatorsCount 1 The maximum nominator count before we stop allowing new validators to join. When this value is not set, no limits are enforced.(CurrentEra\ The current era index.e This is the latest planned era, depending on how the Session pallet queues the validator set, it might be active or not.$ActiveEra- The active era information, it holds index and start.Y The active era is the era being currently rewarded. Validator set of this era must be equal to [`SessionInterface::validators`].TErasStartSessionIndex1 The session index at which the era start for the last `HISTORY_DEPTH` eras.a Note: This tracks the starting session (i.e. session index when era start being active) for the eras in `[CurrentEra - HISTORY_DEPTH, CurrentEra]`.,ErasStakers1 x Exposure of validator at era.a This is keyed first by the era index to allow bulk deletion and then the stash account. Is it removed after `HISTORY_DEPTH` eras.A If stakers hasn't been set or has been removed then empty exposure is returned.HErasStakersClipped1 , Clipped Exposure of validator at era.Y This is similar to [`ErasStakers`] but number of nominators exposed is reduced to the `T::MaxNominatorRewardedPerValidator` biggest stakers. (Note: the field `total` and `own` of the exposure remains unchanged). This is used to limit the i/o cost for the nominator payout.] This is keyed fist by the era index to allow bulk deletion and then the stash account. Is it removed after `HISTORY_DEPTH` eras.A If stakers hasn't been set or has been removed then empty exposure is returned.HErasValidatorPrefs1e Similar to `ErasStakers`, this holds the preferences of validators.a This is keyed first by the era index to allow bulk deletion and then the stash account. Is it removed after `HISTORY_DEPTH` eras.LErasValidatorReward  The total validator era payout for the last `HISTORY_DEPTH` eras.! Eras that haven't finished yet or has been removed doesn't have reward.@ErasRewardPoints5 Rewards for the last `HISTORY_DEPTH` eras.% If reward hasn't been set or has been removed then 0 reward is returned.8ErasTotalStake@ The total amount staked for the last `HISTORY_DEPTH` eras. If total hasn't been set or has been removed then 0 stake is returned. ForceEraET Mode of era forcing.LSlashRewardFraction The percentage of the slash that is distributed to reporters. The rest of the slashed value is handled by the `Slash`.LCanceledSlashPayout@ The amount of currency given to reporters of a slash event which was canceled by extraordinary circumstances (e.g. governance).@UnappliedSlashesI All unapplied slashes that are queued for later.(BondedEras% A mapping from still-bonded eras to the first session index of that era. Must contains information for eras for the range: `[active_era - bounding_duration; active_era]`LValidatorSlashInEra1QE All slashing events on validators, mapped by era to the highest slash proportionp and slash value of the era.LNominatorSlashInEra1a All slashing events on nominators, mapped by era to the highest slash value of the era.4SlashingSpansU Slashing spans for stash accounts.$SpanSlashAY= Records information about the maximum slash of a stash within a slashing span, as well as how much reward has been paid out.XEarliestUnappliedSlash The earliest era for which we have a pending, unapplied slash.TCurrentPlannedSession The last planned session scheduled by the session pallet.q This is basically in sync with the call to [`pallet_session::SessionManager::new_session`].8StorageVersion] True if network has been upgraded to this version.| Storage version of the pallet. This is set to v7.0.0 for new networks.8ChillThresholdq Q The threshold for when users can start calling `chill_other` for other validators /Y nominators. The threshold is compared to the actual number of validators / nominators) (`CountFor*`) in the system compared to the configured max (`Max*Count`).]8SessionsPerErap Number of sessions per era.`, this is because values ofi different types are not supported at the moment so we are doing the manual serialization.(Historical!SessionSession(Validators| The current set of validators.0CurrentIndexx Current index of the session.4QueuedChanged9 True if the underlying economic identities or weighting behind the validators has changed in the queued validator set.(QueuedKeysm= The queued keys for the next session. When the next session begins, these keys will be used to determine the validator's session keys.HDisabledValidatorsu Indices of disabled validators.5 The set is cleared when `on_session_ending` returns a new set of identities. NextKeys The next session keys for a validator. KeyOwneru  The owner of a key. The key is the `KeyTypeId` + the encoded key.} GrandpaGrandpaState State of the current authority set.4PendingChange Pending change: (signaled at, scheduled change).(NextForced next block number where we can force a change.Stalledt `true` if we are currently stalled.0CurrentSetId ] The number of changes (both in terms of keys and underlying economic responsibilities) in the "set" of Grandpa validators from genesis.0SetIdSession Y A mapping from grandpa set ID to the index of the *most recent* session for which itsh members were responsible. TWOX-NOTE: `SetId` is not under user control.8MaxAuthorities\ Max Authorities in use ImOnline ImOnline8HeartbeatAfter, The block number after which it's ok to send heartbeats in the current$ session.% At the beginning of each session we set this to a value that should fall5 roughly in the middle of the session duration. The idea is to first wait for the validators to produce a block in the current session, so that the heartbeat later on will not be necessary.9 This value will only be used as a fallback if we fail to get a proper session- progress estimate from `NextSessionRotation`, as those estimates should be more accurate then the value we calculate for `HeartbeatAfter`.Keys The current set of keys that may issue a heartbeat.HReceivedHeartbeatst= For each session index, we keep a mapping of `SessionIndex` and `AuthIndex` to `WrapperOpaque`.8AuthoredBlocks1 For each session index, we keep a mapping of `ValidatorId` to the number of blocks authored by the given authority.@UnsignedPriority  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. HAuthorityDiscovery $Democracy$Democracy8` is bounded on this value. If you update this value during an election, you _must_ ensure thatM `SignedSubmissionIndices.len()` is less than or equal to the new value. Otherwise, attempts to submit new solutions may cause a runtime panic.` is effectively a `bool`, but it never hits storage in the `None` variant due to the guarantees of FRAME's storage APIs.I If this is `None` at the end of the block, we panic and render the block invalid.64ParaScheduler4ParaScheduler= `expected_at`.8FutureCodeHashQe The actual future code hash of a para. Corresponding code can be retrieved with [`CodeByHash`].PUpgradeGoAheadSignalQU$ This is used by the relay-chain to communicate to a parachain a go-ahead with in the upgrade procedure.u This value is absent when there are no upgrades scheduled or during the time the relay chain} performs the checks. It is set at the first relay-chain block when the corresponding parachaine can switch its upgrade function. As soon as the parachain's block is included, the valueX gets reset to `None`.e NOTE that this field is used by parachains via merkle storage proofs, therefore changing the format will require migration of parachains.`UpgradeRestrictionSignalQY$i This is used by the relay-chain to communicate that there are restrictions for performing| an upgrade for this parachain.Y This may be a because the parachain waits for the upgrade cooldown to expire. Anotherm potential use case is when we want to perform some maintenance (such as storage migration) we could restrict upgrades to make the process simpler.e NOTE that this field is used by parachains via merkle storage proofs, therefore changing the format will require migration of parachains.@UpgradeCooldownsQ Q The list of parachains that are awaiting for their upgrade restriction to cooldown. Ordered ascending by block number.@UpcomingUpgradesQY The list of upcoming code upgrades. Each item is a pair of which para performs a code upgrade and at which relay-chain block it is expected at. Ordered ascending by block number.0ActionsQueue- The actions to perform during the start of a specific session index.PUpcomingParasGenesisQ] Upcoming paras instantiation arguments.8CodeByHashRefse) The number of reference on the validation code in [`CodeByHash`] storage.(CodeByHashe% Validation code stored by its hash.1 This storage is consistent with [`FutureCodeHash`], [`CurrentCodeHash`] andH [`PastCodeHash`].Qua8,Initializer,Initializer8HasInitialized ! Whether the parachains modules have been initialized within this block.% Semantically a `bool`, but this guarantees it should never hit the trie,i as this is cleared in `on_finalize` and Frame optimizes `None` values to be empty values.} As a `bool`, `set(false)` and `remove()` both lead to the next `get()` being false, but one ofy them writes to the trie and one does not. This confusion makes `Option<()>` more suitable for the semantics of this variable.XBufferedSessionChangeseY Buffered session changes along with the block number at which they should be applied.] Typically this will be empty or one element long. Apart from that this item never hits4 the storage.i However this is a `Vec` regardless to handle various edge cases that may occur at runtime upgrade boundaries or if governance intervenes.U9 Dmp DmpTDownwardMessageQueuesQm The downward messages addressed for a certain para.dDownwardMessageQueueHeadsQ$% A mapping that stores the downward message queue MQC head for each para. Each link in this chain has a form:x `(prev_head, B, H(M))`, where - `prev_head`: is the previous head hash or zero if none.! - `B`: is the relay-chain block number in which a message was appended. - `H(M)`: is the hash of the message being appended.Y: Ump UmpLRelayDispatchQueuesQq The messages waiting to be handled by the relay-chain originating from a certain parachain.y Note that some upward messages might have been already processed by the inclusion logic. E.g.t channel management messages. The messages are processed in FIFO order.XRelayDispatchQueueSizeQt ,E Size of the dispatch queues. Caches sizes of the queues in `RelayDispatchQueue`. First item in the tuple is the count of messages and second is the total length (in bytes) of the message payloads.y Note that this is an auxiliary mapping: it's possible to tell the byte size and the number ofy messages only looking at `RelayDispatchQueues`. This mapping is separate to avoid the cost of= loading the whole message queue if only the total size and count are required., Invariant:E - The set of keys should exactly match the set of keys of `RelayDispatchQueues`.4NeedsDispatch- The ordered list of `ParaId`s that have a `RelayDispatchQueue` entry., Invariant:5 - The set of items from this vector should be exactly the set of the keys in `RelayDispatchQueues` and `RelayDispatchQueueSize`.hNextDispatchRoundStartWithQ} This is the para that gets will get dispatched first during the next upward dispatchable queueD execution round., Invariant:  - If `Some(para)`, then `para` must be present in `NeedsDispatch`.(Overweight u  The messages that exceeded max individual message weight budget. These messages stay there until manually dispatched.` is never empty. - The inner `Vec` cannot store two same `ParaId`. - The outer vector is sorted ascending by block number and cannot store two items with the same@ block number.a<