Please use this identifier to cite or link to this item:
http://hdl.handle.net/10609/127926
Title: | Blockchain, algoritmos de consenso |
Author: | Amores Martínez, Andrés |
Tutor: | Hernández Jiménez, Enric |
Abstract: | In the early 70´s when Distributed Computer Systems started, the theorem of 2 generals was proposed to understand the complexity of reaching agreements in the communication through a hostile environment. Two generals need to reach a consensus about to attack or to retire in the siege of a town where the communication between them should go through the enemy town where information can be lost, delayed or modified. Nowadays, in the Distributed Computer System networks, as Blockchain networks, we are having thousands of computers connected to each other, sharing information and reaching agreements. The communication among the nodes is going through a hostile environment, INTERNET. Therefore, the question is how it is possible for so many nodes, with different interests and surrounded by such a hostile environment, to be able to reach an agreement to validate the data and network information. The answer is as easy as a complex one, through a Consensus Algorithm. |
Keywords: | blockchain algorithms consensus |
Document type: | info:eu-repo/semantics/masterThesis |
Issue Date: | 29-Dec-2020 |
Publication license: | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Appears in Collections: | Trabajos finales de carrera, trabajos de investigación, etc. |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
aamoresmTFM1220memoria.pdf | Memoria del TFM | 1,09 MB | Adobe PDF | View/Open |
Share:
This item is licensed under a Creative Commons License