"uuid","repository link","title","author","contributor","publication year","abstract","subject topic","language","publication type","publisher","isbn","issn","patent","patent status","bibliographic note","access restriction","embargo date","faculty","department","research group","programme","project","coordinates"
"uuid:350a232c-59d2-4591-9835-363675025f76","http://resolver.tudelft.nl/uuid:350a232c-59d2-4591-9835-363675025f76","Coordinate Routing in the Lightning Network","Kohalli, Shivanand (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Embedded and Networked Systems)","Roos, S. (mentor); Pouwelse, J.A. (graduation committee); Nasri, Mitra (graduation committee); Delft University of Technology (degree granting institution)","2019","Blockchains such as the Bitcoin facilitate the online transaction between users without an intermediate financial institution and can serve as a global currency. However, at the moment, blockchain solutions are suffering from low transaction throughput and high delays. For instance, the bitcoin network processes at most 7 transactions per second. Blockchain second layer solutions aim to solve this transaction scaling problem with the idea of creating off-chain transactions using payment channels. For a payment channel, the blockchain network is only required to initialize and terminate the channels. Otherwise, they can finalize transactions between pairs of users instantly without using the blockchain network. The Lightning Network is one such payment channel solution that creates an overlay network on top of the blockchain and routes payments across users. Currently, the Lightning network uses source routing to route payments from a source to a destination. However, source routing does not scale to large networks.
In this thesis, we begin by establishing the requirements for routing in the Lightning Network. Next, we analyze generic payment routing algorithms based on the set requirements and understand their limitations. Further, we design a routing algorithm for the Lightning Network that builds upon the key ideas found in the previous work. We, in particular, provide design solutions for computing transaction fees and communicating errors in a privacy-preserving manner. These problems were not addressed in any earlier works. Finally, we implement our algorithm in an active Lightning Network codebase. We evaluate it with regard to security, privacy, and performance requirements and also compare the same with the existing solution.","lightning network; routing algorithm; blockchain; distributed systems","en","master thesis","","","","","","","","","","","","Electrical Engineering | Embedded Systems","",""
"uuid:86b2d4d8-642e-4d0f-8fc7-d7a2e331e0e9","http://resolver.tudelft.nl/uuid:86b2d4d8-642e-4d0f-8fc7-d7a2e331e0e9","A Blockchain Consensus Protocol With Horizontal Scalability","Cong, Kelong (TU Delft Electrical Engineering, Mathematics and Computer Science)","Epema, Dick (graduation committee); Pouwelse, Johan (mentor); Erkin, Zekeriya (graduation committee); Delft University of Technology (degree granting institution)","2017","Blockchain systems have the potential to decentralise many traditionally centralised systems. However, scalability remains a key challenge. Without a horizontally scalable solution, where performance increases by adding more nodes to the system, blockchain systems remain unsuitable for ubiquitous use. We design a novel blockchain system called Checo. Each node in our system maintains a personal hash chain, which only stores transactions that the node is involved in. A consensus is reached on special blocks called checkpoint blocks rather than on all the transactions. Checkpoint blocks are effectively a hash pointer to the personal hash chains; thus a single checkpoint block may represent an arbitrarily large set of transactions. We introduce a validation protocol so that any node can check the validity of any transaction. Since it is a point-to-point protocol, we achieve horizontal scalability. We analytically evaluate our system and proof a number of highly desirable correctness properties. Further, we give a free and open-source implementation of Checo and evaluate it experimentally. Our results show a strong indication of horizontal scalability.","blockchain; consensus; distributed systems","en","master thesis","","","","","","","","","","","","","",""