Merge pull request #12709 from ethereum/fix-typos

Fix some errors and typos across files

Author: nhsz

public/content/developers/docs/consensus-mechanisms/pos/keys/index.md

@@ -10,7 +10,7 @@ Ethereum's keys are generated using [elliptic-curve cryptography](https://en.wik
 
 However, when Ethereum switched from [proof-of-work](/developers/docs/consensus-mechanisms/pow) to [proof-of-stake](/developers/docs/consensus-mechanisms/pos) a new type of key was added to Ethereum. The original keys still work exactly the same as before—there were no changes to the elliptic-curve-based keys securing accounts. However, users needed a new type of key for participating in proof-of-stake by staking ETH and running validators. This need arose from scalability challenges associated with many messages passing between large numbers of validators that required a cryptographic method that could easily be aggregated to reduce the amount of communication required for the network to come to consensus.
 
-This new type of key uses the [**Boneh-Lyn-Shacham (BLS)** signature scheme](https://wikipedia.org/wiki/BLS_digital_signature). BLS enables a very efficient aggregation of signatures but also allows reverse engineering of aggregated individual validator keys and is ideal for managing actions between validators.
+This new type of key uses the [**Boneh-Lynn-Shacham (BLS)** signature scheme](https://wikipedia.org/wiki/BLS_digital_signature). BLS enables a very efficient aggregation of signatures but also allows reverse engineering of aggregated individual validator keys and is ideal for managing actions between validators.
 
 ## The two types of validator keys {#two-types-of-keys}
 

public/content/developers/docs/consensus-mechanisms/pow/mining/mining-algorithms/dagger-hashimoto/index.md

@@ -281,7 +281,7 @@ Hence `x` must be a multiplicative identity of `ℤ/nℤ`, which is unique. Sinc
 
 The order of `x` cannot be `2` unless `x = P-1`, since this would violate that `P` is prime.
 
-From the above proposition, we can recognize that iterating `(picker * init) % P` will have a cycle length of at least `(P-1)/2`. This is because we selected `P` to be a safe prime approximately equal to be a higher power of two, and `init` is in the interval `[2,2**256+1]`. Given the magnitude fo `P`, we should never expect a cycle from modular exponentiation.
+From the above proposition, we can recognize that iterating `(picker * init) % P` will have a cycle length of at least `(P-1)/2`. This is because we selected `P` to be a safe prime approximately equal to be a higher power of two, and `init` is in the interval `[2,2**256+1]`. Given the magnitude of `P`, we should never expect a cycle from modular exponentiation.
 
 When we are assigning the first cell in the DAG (the variable labeled `init`), we compute `pow(sha3(seed) + 2, 3, P)`. At first glance, this does not guarantee that the result is neither `1` nor `P-1`. However, since `P-1` is a safe prime, we have the following additional assurance, which is a corollary of Observation 1:
 

public/content/developers/docs/consensus-mechanisms/pow/mining/mining-algorithms/index.md

@@ -28,7 +28,7 @@ More on [Dagger-Hashimoto](/developers/docs/consensus-mechanisms/pow/mining/mini
 
 ## Ethash {#ethash}
 
-Ethash was the mining algorithm that was actually used on the real Ethereum Mainnet under the now deprecated proof-of-work architecture. Ethash was effectively a new name given to a specific version of Dagger-Hashimoto after the algorithm got significantly updated, whilst still inheriting the fundamental principles of its predecessor. Ethereum Mainnet only ever used Ethash - Dagger Hashimoto was an R&D version of the mining algorithm that was superseded before mining started on Ethereum mainnet.
+Ethash was the mining algorithm that was actually used on the real Ethereum Mainnet under the now deprecated proof-of-work architecture. Ethash was effectively a new name given to a specific version of Dagger-Hashimoto after the algorithm got significantly updated, whilst still inheriting the fundamental principles of its predecessor. Ethereum Mainnet only ever used Ethash - Dagger Hashimoto was an R&D version of the mining algorithm that was superseded before mining started on Ethereum Mainnet.
 
 [More on Ethash](/developers/docs/consensus-mechanisms/pow/mining/mining-algorithms/ethash).
 

public/content/developers/tutorials/deploying-your-first-smart-contract/index.md

@@ -74,7 +74,7 @@ Then navigate to the deploy and run transactions screen:
 
 ![The deploy icon in the Remix toolbar](./remix-deploy.png)
 
-Once you are on the "deploy and run" transactions screen, double check that your contract name appears and click on Deploy. As you can see on the top of the page, the current environment is “JavaScript VM” that means that we’ll deploy and interact with our smart contract on a local test blockchain to be able to test faster and without any fees.
+Once you are on the "deploy and run transactions" screen, double check that your contract name appears and click on Deploy. As you can see on the top of the page, the current environment is “JavaScript VM” that means that we’ll deploy and interact with our smart contract on a local test blockchain to be able to test faster and without any fees.
 
 ![The deploy button in the Remix solidity compiler](./remix-deploy-button.png)
 

public/content/developers/tutorials/hello-world-smart-contract-fullstack/index.md

@@ -945,7 +945,7 @@ To load your Hello World smart contract, you'll need its contract address and AB
 
 #### How to get your contract ABI from Etherscan {#how-to-get-your-contract-abi-from-etherscan}
 
-If you skipped Part 3 of this tutorial, you can use the HelloWorld contract with address [0x6f3f635A9762B47954229Ea479b4541eAF402A6A](https://goerli.etherscan.io/address/0x6f3f635a9762b47954229ea479b4541eaf402a6a#code). It's ABI can be found [here](https://goerli.etherscan.io/address/0x6f3f635a9762b47954229ea479b4541eaf402a6a#code).
+If you skipped Part 3 of this tutorial, you can use the HelloWorld contract with address [0x6f3f635A9762B47954229Ea479b4541eAF402A6A](https://goerli.etherscan.io/address/0x6f3f635a9762b47954229ea479b4541eaf402a6a#code). Its ABI can be found [here](https://goerli.etherscan.io/address/0x6f3f635a9762b47954229ea479b4541eaf402a6a#code).
 
 A contract ABI is necessary for specifying which function a contract will invoke as well ensuring that the function will return data in the format you're expecting. Once we've copied our contract ABI, let's save it as a JSON file called `contract-abi.json` in your `src` directory.
 

public/content/developers/tutorials/the-graph-fixing-web3-data-querying/index.md

@@ -87,7 +87,7 @@ Now let's look at a better solution.
 
 ## Let me introduce you to GraphQL {#let-me-introduce-to-you-graphql}
 
-First let's talk about GraphQL, originally designed and implemented by Facebook. You might be familiar with the traditional Rest API model. Now imagine instead you could write a query for exactly the data that you wanted:
+First let's talk about GraphQL, originally designed and implemented by Facebook. You might be familiar with the traditional REST API model. Now imagine instead you could write a query for exactly the data that you wanted:
 
 ![GraphQL API vs. REST API](./graphql.jpg)
 

public/content/roadmap/secret-leader-election/index.md

@@ -16,7 +16,7 @@ This could create opportunities for an attacker to profit. For example a block p
 
 There are several solutions to this problem. One is [Distributed Validator Technology](https://github.com/ethereum/distributed-validator-specs) which aims to spread the various tasks related to running a validator across multiple machines, with redundancy, so that it is much harder for an attacker to prevent a block from being proposed in a particular slot. However, the most robust solution is **Single Secret Leader Election (SSLE)**.
 
-## Secret single leader election {#secret-leader-election}
+## Single secret leader election {#secret-leader-election}
 
 In SSLE, clever cryptography is used to ensure that only the selected validator knows they have been selected. This works by having each validator submit a commitment to a secret they all share. The commitments are shuffled and reconfigured so that no-one can map commitments to validators but each validator knows which commitment belongs to them. Then, one commitment is chosen at random. If a validator detects that their commitment was chosen, they know it is their turn to propose a block.
 

src/intl/en/glossary.json

@@ -146,7 +146,7 @@
   "erc-term": "Ethereum Request for Comments (ERC)",
   "erc-definition": "ERC (<strong>Ethereum Request for Comments</strong>) is a type of technical documentation used in the Ethereum community to propose new standards of usage for the Ethereum network.<br /><br />These proposals can cover a wide range of topics, including new token standards (like ERC-20 used for tokens and ERC-721 for NFTs).",
   "ethash-term": "Ethash",
-  "ethash-definition": "A <a href=\"/glossary/#pow\">proof-of-work</a> algorithm that was used on Ethereum before it transitioned to <a href=\"/glossary/#pos\">proof-of-stake. <a href=\"/developers/docs/consensus-mechanisms/pow/mining/mining-algorithms/ethash\">Read more</a>",
+  "ethash-definition": "A <a href=\"/glossary/#pow\">proof-of-work</a> algorithm that was used on Ethereum before it transitioned to <a href=\"/glossary/#pos\">proof-of-stake</a>. <a href=\"/developers/docs/consensus-mechanisms/pow/mining/mining-algorithms/ethash\">Read more</a>",
   "ether-term": "Ether",
   "ether-definition": "The native cryptocurrency of Ethereum, commonly referred to as “ETH”. It is used to cover transaction fees when using Ethereum ecosystem and applications. <a href=\"/eth/\">More on ether</a>.",
   "events-term": "Events",