Fix spelling mistakes across the whole repository (#3808)

**Update:** Pushed additional changes based on the review comments.

**This pull request fixes various spelling mistakes in this
repository.**

Most of the changes are contained in the first **3** commits:

- `Fix spelling mistakes in comments and docs`

- `Fix spelling mistakes in test names`

- `Fix spelling mistakes in error messages, panic messages, logs and
tracing`

Other source code spelling mistakes are separated into individual
commits for easier reviewing:

- `Fix the spelling of 'authority'`

- `Fix the spelling of 'REASONABLE_HEADERS_IN_JUSTIFICATION_ANCESTRY'`

- `Fix the spelling of 'prev_enqueud_messages'`

- `Fix the spelling of 'endpoint'`

- `Fix the spelling of 'children'`

- `Fix the spelling of 'PenpalSiblingSovereignAccount'`

- `Fix the spelling of 'PenpalSudoAccount'`

- `Fix the spelling of 'insufficient'`

- `Fix the spelling of 'PalletXcmExtrinsicsBenchmark'`

- `Fix the spelling of 'subtracted'`

- `Fix the spelling of 'CandidatePendingAvailability'`

- `Fix the spelling of 'exclusive'`

- `Fix the spelling of 'until'`

- `Fix the spelling of 'discriminator'`

- `Fix the spelling of 'nonexistent'`

- `Fix the spelling of 'subsystem'`

- `Fix the spelling of 'indices'`

- `Fix the spelling of 'committed'`

- `Fix the spelling of 'topology'`

- `Fix the spelling of 'response'`

- `Fix the spelling of 'beneficiary'`

- `Fix the spelling of 'formatted'`

- `Fix the spelling of 'UNKNOWN_PROOF_REQUEST'`

- `Fix the spelling of 'succeeded'`

- `Fix the spelling of 'reopened'`

- `Fix the spelling of 'proposer'`

- `Fix the spelling of 'InstantiationNonce'`

- `Fix the spelling of 'depositor'`

- `Fix the spelling of 'expiration'`

- `Fix the spelling of 'phantom'`

- `Fix the spelling of 'AggregatedKeyValue'`

- `Fix the spelling of 'randomness'`

- `Fix the spelling of 'defendant'`

- `Fix the spelling of 'AquaticMammal'`

- `Fix the spelling of 'transactions'`

- `Fix the spelling of 'PassingTracingSubscriber'`

- `Fix the spelling of 'TxSignaturePayload'`

- `Fix the spelling of 'versioning'`

- `Fix the spelling of 'descendant'`

- `Fix the spelling of 'overridden'`

- `Fix the spelling of 'network'`

Let me know if this structure is adequate.

**Note:** The usage of the words `Merkle`, `Merkelize`, `Merklization`,
`Merkelization`, `Merkleization`, is somewhat inconsistent but I left it
as it is.

~~**Note:** In some places the term `Receival` is used to refer to
message reception, IMO `Reception` is the correct word here, but I left
it as it is.~~

~~**Note:** In some places the term `Overlayed` is used instead of the
more acceptable version `Overlaid` but I also left it as it is.~~

~~**Note:** In some places the term `Applyable` is used instead of the
correct version `Applicable` but I also left it as it is.~~

**Note:** Some usage of British vs American english e.g. `judgement` vs
`judgment`, `initialise` vs `initialize`, `optimise` vs `optimize` etc.
are both present in different places, but I suppose that's
understandable given the number of contributors.

~~**Note:** There is a spelling mistake in `.github/CODEOWNERS` but it
triggers errors in CI when I make changes to it, so I left it as it
is.~~

polkadot/runtime/parachains/src/assigner_coretime/tests.rs

@@ -622,7 +622,7 @@ fn assignment_proportions_in_core_state_work() {
 			);
 		}
 
-		// Case 2: Current assignment remaning < step after pop
+		// Case 2: Current assignment remaining < step after pop
 		{
 			assert_eq!(
 				CoretimeAssigner::pop_assignment_for_core(core_idx),

polkadot/runtime/parachains/src/assigner_on_demand/mod.rs

@@ -684,7 +684,7 @@ where
 
 	/// Adds an order to the on demand queue.
 	///
-	/// Paramenters:
+	/// Parameters:
 	/// - `location`: Whether to push this entry to the back or the front of the queue. Pushing an
 	///   entry to the front of the queue is only used when the scheduler wants to push back an
 	///   entry it has already popped.
@@ -763,7 +763,7 @@ where
 
 	/// Increases the affinity of a `ParaId` to a specified `CoreIndex`.
 	/// Adds to the count of the `CoreAffinityCount` if an entry is found and the core_index
-	/// matches. A non-existant entry will be initialized with a count of 1 and uses the  supplied
+	/// matches. A non-existent entry will be initialized with a count of 1 and uses the  supplied
 	/// `CoreIndex`.
 	fn increase_affinity(para_id: ParaId, core_index: CoreIndex) {
 		ParaIdAffinity::<T>::mutate(para_id, |maybe_affinity| match maybe_affinity {

polkadot/runtime/parachains/src/coretime/migration.rs

@@ -238,7 +238,7 @@ mod v_coretime {
 					return None
 				},
 			};
-			// We assume the coretime chain set this parameter to the recommened value in RFC-1:
+			// We assume the coretime chain set this parameter to the recommended value in RFC-1:
 			const TIME_SLICE_PERIOD: u32 = 80;
 			let round_up = if valid_until % TIME_SLICE_PERIOD > 0 { 1 } else { 0 };
 			let time_slice = valid_until / TIME_SLICE_PERIOD + TIME_SLICE_PERIOD * round_up;

polkadot/runtime/parachains/src/disputes.rs

@@ -181,7 +181,7 @@ pub trait DisputesHandler<BlockNumber: Ord> {
 	fn is_frozen() -> bool;
 
 	/// Remove dispute statement duplicates and sort the non-duplicates based on
-	/// local (lower indicies) vs remotes (higher indices) and age (older with lower indices).
+	/// local (lower indices) vs remotes (higher indices) and age (older with lower indices).
 	///
 	/// Returns `Ok(())` if no duplicates were present, `Err(())` otherwise.
 	///

polkadot/runtime/parachains/src/disputes/slashing.rs

@@ -643,7 +643,7 @@ fn is_known_offence<T: Config>(
 	}
 }
 
-/// Actual `HandleReports` implemention.
+/// Actual `HandleReports` implementation.
 ///
 /// When configured properly, should be instantiated with
 /// `T::KeyOwnerIdentification, Offences, ReportLongevity` parameters.

polkadot/runtime/parachains/src/hrmp.rs

@@ -229,12 +229,12 @@ impl fmt::Debug for OutboundHrmpAcceptanceErr {
 			),
 			TotalSizeExceeded { idx, total_size, limit } => write!(
 				fmt,
-				"sending the HRMP message at index {} would exceed the neogitiated channel total size  ({} > {})",
+				"sending the HRMP message at index {} would exceed the negotiated channel total size  ({} > {})",
 				idx, total_size, limit,
 			),
 			CapacityExceeded { idx, count, limit } => write!(
 				fmt,
-				"sending the HRMP message at index {} would exceed the neogitiated channel capacity  ({} > {})",
+				"sending the HRMP message at index {} would exceed the negotiated channel capacity  ({} > {})",
 				idx, count, limit,
 			),
 		}
@@ -790,7 +790,7 @@ pub mod pallet {
 							.ok_or(ArithmeticError::Underflow)?;
 						T::Currency::unreserve(
 							&channel_id.sender.into_account_truncating(),
-							// The difference should always be convertable into `Balance`, but be
+							// The difference should always be convertible into `Balance`, but be
 							// paranoid and do nothing in case.
 							amount.try_into().unwrap_or(Zero::zero()),
 						);

polkadot/runtime/parachains/src/hrmp/tests.rs

@@ -702,7 +702,7 @@ fn verify_externally_accessible() {
 			sp_io::storage::get(&well_known_keys::hrmp_ingress_channel_index(para_b))
 				.expect("the ingress index must be present for para_b");
 		let ingress_index = <Vec<ParaId>>::decode(&mut &raw_ingress_index[..])
-			.expect("ingress indexx should be decodable as a list of para ids");
+			.expect("ingress index should be decodable as a list of para ids");
 		assert_eq!(ingress_index, vec![para_a]);
 
 		// Now, verify that we can access and decode the egress index.

polkadot/runtime/parachains/src/paras/mod.rs

@@ -1756,7 +1756,7 @@ impl<T: Config> Pallet<T> {
 		//
 		// - Empty value is treated as the current code is already inserted during the onboarding.
 		//
-		// This is only an intermediate solution and should be fixed in foreseable future.
+		// This is only an intermediate solution and should be fixed in foreseeable future.
 		//
 		// [soaking issue]: https://github.com/paritytech/polkadot/issues/3918
 		let validation_code =

polkadot/runtime/parachains/src/paras/tests.rs

@@ -1210,7 +1210,7 @@ fn code_hash_at_returns_up_to_end_of_code_retention_period() {
 		assert_eq!(Paras::past_code_meta(&para_id).upgrade_times, vec![upgrade_at(4, 10)]);
 		assert_eq!(Paras::current_code(&para_id), Some(new_code.clone()));
 
-		// Make sure that the old code is available **before** the code retion period passes.
+		// Make sure that the old code is available **before** the code retention period passes.
 		run_to_block(10 + code_retention_period, None);
 		assert_eq!(Paras::code_by_hash(&old_code.hash()), Some(old_code.clone()));
 		assert_eq!(Paras::code_by_hash(&new_code.hash()), Some(new_code.clone()));
@@ -1717,7 +1717,7 @@ fn poke_unused_validation_code_doesnt_remove_code_with_users() {
 
 #[test]
 fn increase_code_ref_doesnt_have_allergy_on_add_trusted_validation_code() {
-	// Verify that accidential calling of increase_code_ref or decrease_code_ref does not lead
+	// Verify that accidental calling of increase_code_ref or decrease_code_ref does not lead
 	// to a disaster.
 	// NOTE that this test is extra paranoid, as it is not really possible to hit
 	// `decrease_code_ref` without calling `increase_code_ref` first.

polkadot/runtime/parachains/src/paras_inherent/mod.rs

@@ -733,7 +733,7 @@ fn random_sel<X, F: Fn(&X) -> Weight>(
 /// are preferred. And for disputes, local and older disputes are preferred (see
 /// `limit_and_sanitize_disputes`). for backed candidates, since with a increasing number of
 /// parachains their chances of inclusion become slim. All backed candidates  are checked
-/// beforehands in `fn create_inherent_inner` which guarantees sanity.
+/// beforehand in `fn create_inherent_inner` which guarantees sanity.
 ///
 /// Assumes disputes are already filtered by the time this is called.
 ///
@@ -1070,7 +1070,7 @@ fn limit_and_sanitize_disputes<
 		log::debug!(target: LOG_TARGET, "Above max consumable weight: {}/{}", disputes_weight, max_consumable_weight);
 		let mut checked_acc = Vec::<CheckedDisputeStatementSet>::with_capacity(disputes.len());
 
-		// Accumualated weight of all disputes picked, that passed the checks.
+		// Accumulated weight of all disputes picked, that passed the checks.
 		let mut weight_acc = Weight::zero();
 
 		// Select disputes in-order until the remaining weight is attained

polkadot/runtime/parachains/src/scheduler/migration.rs

@@ -24,7 +24,7 @@ use frame_support::{
 
 /// Old/legacy assignment representation (v0).
 ///
-/// `Assignment` used to be a concrete type with the same layout V0Assignment, idential on all
+/// `Assignment` used to be a concrete type with the same layout V0Assignment, identical on all
 /// assignment providers. This can be removed once storage has been migrated.
 #[derive(Encode, Decode, RuntimeDebug, TypeInfo, PartialEq, Clone)]
 struct V0Assignment {

polkadot/runtime/parachains/src/scheduler/tests.rs

@@ -836,7 +836,7 @@ fn on_demand_claims_are_pruned_after_timing_out() {
 
 		// #26
 		now += 1;
-		// Run to block #n but this time have group 1 conclude the availabilty.
+		// Run to block #n but this time have group 1 conclude the availability.
 		for n in now..=(now + max_timeouts + 1) {
 			// #n
 			run_to_block(n, |_| None);

polkadot/runtime/parachains/src/session_info.rs

@@ -158,7 +158,7 @@ impl<T: Config> Pallet<T> {
 			for idx in old_earliest_stored_session..new_earliest_stored_session {
 				Sessions::<T>::remove(&idx);
 				// Idx will be missing for a few sessions after the runtime upgrade.
-				// But it shouldn'be be a problem.
+				// But it shouldn't be a problem.
 				AccountKeys::<T>::remove(&idx);
 				SessionExecutorParams::<T>::remove(&idx);
 			}

polkadot/runtime/parachains/src/ump_tests.rs

@@ -456,7 +456,7 @@ fn verify_relay_dispatch_queue_size_is_externally_accessible() {
 fn assert_queue_size(para: ParaId, count: u32, size: u32) {
 	#[allow(deprecated)]
 	let raw_queue_size = sp_io::storage::get(&well_known_keys::relay_dispatch_queue_size(para)).expect(
-		"enqueing a message should create the dispatch queue\
+		"enqueuing a message should create the dispatch queue\
 				and it should be accessible via the well known keys",
 	);
 	let (c, s) = <(u32, u32)>::decode(&mut &raw_queue_size[..])
@@ -466,7 +466,7 @@ fn assert_queue_size(para: ParaId, count: u32, size: u32) {
 	// Test the deprecated but at least type-safe `relay_dispatch_queue_size_typed`:
 	#[allow(deprecated)]
 	let (c, s) = well_known_keys::relay_dispatch_queue_size_typed(para).get().expect(
-		"enqueing a message should create the dispatch queue\
+		"enqueuing a message should create the dispatch queue\
 				and it should be accessible via the well known keys",
 	);
 	assert_eq!((c, s), (count, size));