remove extra space

Remove extra space in "a n".

consensus.asciidoc

@@ -31,7 +31,7 @@ In general, a PoS algorithm works as follows. The blockchain keeps track of a se
 [[ethash]]
 === Ethash: Ethereum's proof of work
 
-Ethash is the Ethereum Proof-of-Work (PoW) algorithm and uses a n evolution of the Dagger–Hashimoto Algorithm, which is a combination of Vitalik Buterin's Dagger algorithm and Thaddeus Dryja's Hashimoto algorithm. Ethash is dependent on the generation and analysis of a large dataset, known as a _Directed Acyclic Graph_ or more simply _the DAG_. The DAG had an initial size of about 1GB and will continue to slowly and linearly grow in size, being updated once every _epoch_ (30,000 blocks, or roughly 125 hours).
+Ethash is the Ethereum Proof-of-Work (PoW) algorithm and uses an evolution of the Dagger–Hashimoto Algorithm, which is a combination of Vitalik Buterin's Dagger algorithm and Thaddeus Dryja's Hashimoto algorithm. Ethash is dependent on the generation and analysis of a large dataset, known as a _Directed Acyclic Graph_ or more simply _the DAG_. The DAG had an initial size of about 1GB and will continue to slowly and linearly grow in size, being updated once every _epoch_ (30,000 blocks, or roughly 125 hours).
 
 The purpose of the DAG is to make the Ethash PoW algorithm dependent on maintaining a large, frequently accessed data structure. This in turn is intended to make Ethash "ASIC resistant", which means that it is more difficult to make _Application Specific Integrated Circuits (ASIC)_ mining equipment that is orders of magnitude faster than a fast _Graphics Processing Unit (GPU)_. Ethereum's founders wanted to avoid centralization in PoW mining, where those with access to specialized silicon fabrication factories and big budgets could dominate the mining infrastructure and undermine the security of the consensus algorithm.