Maximum Extractable Value (MEV) is a phenomenon in the blockchain ecosystem where privileged actors can extract value from transactions by exploiting the transaction-ordering dependencies. These actors include miners and other actors, such as high-frequency traders or arbitrage bots specifically designed to generate profit by strategies such as reordering transactions, frontrunning, sandwich attacks etc. [1]. Algorand is a blockchain that aims to be secure, scalable, and decentralized. The Algorand platform supports smart contract functionality, and its consensus algorithm is based on a proof-of-stake, and Byzantine Agreement protocol [2]. Algorand’s native cryptocurrency is called Algo [3]. To prioritize transactions in a blockchain using MEV, searchers analyze the transactions in the mempool and look for opportunities to extract MEV. They may include transactions that offer a higher fee, even if they were not submitted first, to extract the maximum possible value from the network. Additionally, miners may engage in other types of MEV extraction, such as frontrunning or sandwich attacks, in which they place a transaction in a specific position in the transaction order to take advantage of the price movements that will result from its execution. This Guided Research project aims to analyze the feasibility of MEV extraction on the Algorand Blockchain. Algorand has no developed fee market; thus how users can prioritize their transactions is currently unknown. Since most MEV extraction techniques depend on the exact position of a transaction, it is important to analyze transaction orderings of past blocks. There has already been an ongoing discussion on this topic [4], and as part of this exercise, we would like to extend this discussion and provide an empirical basis for this discourse.
RQ 1 What are the techniques that Algorand block proposers employ when ordering transactions in the blocks they build?
RQ 2 Is it possible to execute position-dependent MEV strategies on the Algorand blockchain?
[1] P. Daian, S. Goldfeder, T. Kell, Y. Li, X. Zhao, I. Bentov, L. Breidenbach, and A. Juels, “Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability,” in 2020 IEEE Symposium on Security and Privacy (SP). IEEE, 2020, pp. 910–927.
[2] M. Ben-Or and A. Hassidim, “Fast quantum byzantine agreement,” in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005, pp. 481–485.
[3] J. Chen and S. Micali, “Algorand,” arXiv preprint arXiv:1607.01341, 2016.
[4] “AlgorandFAQ,” https://github.com/HashMapsData2Value/AlgorandFAQ/blob/main/README.md#does-algorand-suffer-from-frontrunning-and-miner-extractable-
Name | Type | Size | Last Modification | Last Editor |
---|---|---|---|---|
Final presentation - Guided Research - Parshant Singh.pdf | 2,31 MB | 29.01.2024 | ||
Kick-Off Presentation - Guided Research - Parshant Singh.pdf | 926 KB | 29.01.2024 | ||
Research Proposal - Guided Research - Parshant Singh.pdf | 45 KB | 29.01.2024 | ||
Thesis PDF - Guided Research - Parshant Singh.pdf | 784 KB | 29.01.2024 |