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.~~

substrate/primitives/consensus/babe/src/lib.rs

@@ -266,7 +266,7 @@ impl Default for BabeEpochConfiguration {
 }
 
 /// Verifies the equivocation proof by making sure that: both headers have
-/// different hashes, are targetting the same slot, and have valid signatures by
+/// different hashes, are targeting the same slot, and have valid signatures by
 /// the same authority.
 pub fn check_equivocation_proof<H>(proof: EquivocationProof<H>) -> bool
 where
@@ -298,7 +298,7 @@ where
 		let first_pre_digest = find_pre_digest(&proof.first_header)?;
 		let second_pre_digest = find_pre_digest(&proof.second_header)?;
 
-		// both headers must be targetting the same slot and it must
+		// both headers must be targeting the same slot and it must
 		// be the same as the one in the proof.
 		if proof.slot != first_pre_digest.slot() ||
 			first_pre_digest.slot() != second_pre_digest.slot()

substrate/primitives/consensus/beefy/src/lib.rs

@@ -200,7 +200,7 @@ pub mod ecdsa_bls_crypto {
 		fn verify(&self, signature: &<Self as RuntimeAppPublic>::Signature, msg: &[u8]) -> bool {
 			// We can not simply call
 			// `EcdsaBlsPair::verify(signature.as_inner_ref(), msg, self.as_inner_ref())`
-			// because that invokes ECDSA default verification which perfoms Blake2b hash
+			// because that invokes ECDSA default verification which performs Blake2b hash
 			// which we don't want. This is because ECDSA signatures are meant to be verified
 			// on Ethereum network where Keccak hasher is significantly cheaper than Blake2b.
 			// See Figure 3 of [OnSc21](https://www.scitepress.org/Papers/2021/106066/106066.pdf)

substrate/primitives/consensus/beefy/src/mmr.rs

@@ -15,7 +15,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-//! BEEFY + MMR utilties.
+//! BEEFY + MMR utilities.
 //!
 //! While BEEFY can be used completely independently as an additional consensus gadget,
 //! it is designed around a main use case of bridging standalone networks together.
@@ -77,7 +77,7 @@ pub struct MmrLeaf<BlockNumber, Hash, MerkleRoot, ExtraData> {
 ///
 /// Given that adding new struct elements in SCALE is backward compatible (i.e. old format can be
 /// still decoded, the new fields will simply be ignored). We expect the major version to be bumped
-/// very rarely (hopefuly never).
+/// very rarely (hopefully never).
 #[derive(Debug, Default, PartialEq, Eq, Clone, Encode, Decode, TypeInfo)]
 pub struct MmrLeafVersion(u8);
 impl MmrLeafVersion {

substrate/primitives/consensus/beefy/src/payload.rs

@@ -43,7 +43,7 @@ pub mod known_payloads {
 pub struct Payload(Vec<(BeefyPayloadId, Vec<u8>)>);
 
 impl Payload {
-	/// Construct a new payload given an initial vallue
+	/// Construct a new payload given an initial value
 	pub fn from_single_entry(id: BeefyPayloadId, value: Vec<u8>) -> Self {
 		Self(vec![(id, value)])
 	}

substrate/primitives/consensus/common/src/lib.rs

@@ -182,7 +182,7 @@ pub trait Proposer<B: BlockT> {
 		+ Send
 		+ Unpin
 		+ 'static;
-	/// The supported proof recording by the implementator of this trait. See [`ProofRecording`]
+	/// The supported proof recording by the implementor of this trait. See [`ProofRecording`]
 	/// for more information.
 	type ProofRecording: self::ProofRecording<Proof = Self::Proof> + Send + Sync + 'static;
 	/// The proof type used by [`Self::ProofRecording`].

substrate/primitives/consensus/sassafras/src/ticket.rs

@@ -115,7 +115,7 @@ mod tests {
 		let threshold = ticket_id_threshold(redundancy, slots, attempts, validators);
 		let threshold = threshold as f64 / TicketId::MAX as f64;
 
-		// We expect that the total number of tickets allowed to be submited
+		// We expect that the total number of tickets allowed to be submitted
 		// is slots*redundancy
 		let avt = ((attempts * validators) as f64 * threshold) as u32;
 		assert_eq!(avt, slots * redundancy);

substrate/primitives/consensus/sassafras/src/vrf.rs

@@ -101,7 +101,7 @@ pub fn make_ticket_id(input: &VrfInput, pre_output: &VrfPreOutput) -> TicketId {
 	u128::from_le_bytes(bytes)
 }
 
-/// Make revealed key seed from a given VRF input and pre-ouput.
+/// Make revealed key seed from a given VRF input and pre-output.
 ///
 /// Input should have been obtained via [`revealed_key_input`].
 /// Pre-output should have been obtained from the input directly using the vrf