Not logged in.

Contribution Details

Type Bachelor's Thesis
Scope Discipline-based scholarship
Title Data Analysis on the Scalability and Fairness of Polygon
Organization Unit
Authors
  • Dominic Bachmann
Supervisors
  • Claudio Tessone
Language
  • English
Institution University of Zurich
Faculty Faculty of Business, Economics and Informatics
Date 2023
Abstract Text Ethereum in its current version reaches a maximum transaction throughput of 15 transactions a second and thus suffers from a scalability problem. The Polygon proof-of-stake blockchain presents itself as an already active solution to this problem. Previous research focuses on the fairness in other proof-of-stake blockchains and the scalability issue in general. Our contribution is to provide a careful investigation of incentives and decentralisation in Polygon PoS. To this end, we analyse the scalability potential by having a look at transactions, usage and distribution of rewards to participants in the network. Our results indicate that Polygon PoS, as a cheap solution, can enhance the transaction throughput. Furthermore, the blockchain has a fairly good user adoption paired with climate-friendliness. However, in order to be the ultimate scaling solution, there is the need to double-down on incentives and increase performance by a lot. It can also be shown that certain participants get disproportionately more rewards than others, as seen by applying measures like the Gini and Nakamoto index to the data. Centralisation seems to be a problem throughout the network. In other words, we find that Polygon PoS at the current stage is lacking incentives and decentralisation and only early adopters of the blockchain can profit from it.
PDF File Download
Export BibTeX