Investigating Byzantine Agreement Consensus Algorithm of Algorand

Liu, Yu

Investigating Byzantine Agreement Consensus Algorithm of Algorand

Liu, Yu

Permalink

Publication Type:: Thesis
Issue Date:: 2020

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download contents and abstractAdobe PDF (159.71 kB)

Adobe PDF

Download thesisAdobe PDF (1.35 MB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Liu, Yu
dc.date.accessioned	2020-04-23T22:17:26Z
dc.date.available	2020-04-23T22:17:26Z
dc.date.issued	2020
dc.identifier.uri	http://hdl.handle.net/10453/140228
dc.description	University of Technology Sydney. Faculty of Engineering and Information Technology.	en_AU
dc.description.abstract	After its rapid development and broad adoption in its early stage, blockchain technologies are experiencing a bottleneck in terms of their scalability in processing transactions. There have been various proposals to overcome this difficulty, but very few are able to avoid the curse of the blockchain trilemma in relation to balancing scalability, decentralization, and security. However, Algorand demonstrates its superior capability to process transactions and maintain safety when the number of users increase. In particular, its consensus diminishes the probability of chain forks, which generates the feasibility of double-spend attacks in blockchains. In order to determine if Algorand could be the answer to the trilemma, this thesis presents an investigation of its consensus algorithms and a thorough analysis of its performance and some potential downsides of the proposal.	en_AU
dc.format	Thesis (MAnalytics)
dc.language.iso	en_AU	en_AU
dc.relation	https://opus.lib.uts.edu.au/bitstream/10453/140228/2/02whole.pdf
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.
dc.rights	au.edu.uts.lib/ppc
dc.title	Investigating Byzantine Agreement Consensus Algorithm of Algorand	en_AU
dc.type	Thesis	en_AU
utslib.copyright.status	open_access

Abstract:

After its rapid development and broad adoption in its early stage, blockchain technologies are experiencing a bottleneck in terms of their scalability in processing transactions. There have been various proposals to overcome this difficulty, but very few are able to avoid the curse of the blockchain trilemma in relation to balancing scalability, decentralization, and security. However, Algorand demonstrates its superior capability to process transactions and maintain safety when the number of users increase. In particular, its consensus diminishes the probability of chain forks, which generates the feasibility of double-spend attacks in blockchains. In order to determine if Algorand could be the answer to the trilemma, this thesis presents an investigation of its consensus algorithms and a thorough analysis of its performance and some potential downsides of the proposal.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/140228