Throughput Analysis of a Trustchain Protocol Implementation
T. Chirilă (TU Delft - Electrical Engineering, Mathematics and Computer Science)
B. Nasrulin – Mentor (TU Delft - Data-Intensive Systems)
Johan Pouwelse – Mentor (TU Delft - Data-Intensive Systems)
K.G. Langendoen – Graduation committee member (TU Delft - Embedded Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Blockchain technologies offer decentralized, secure, and transparent transaction sys tems but face significant scalability challenges, especially in mobile and peer-to-peer environments. Directed Acyclic Graph (DAG)-based protocols, such as Trustchain, present a promising alternative by allowing each agent to maintain a personal chain of relevant transactions, thereby improving throughput and reducing resource consump tion. Despite its theoretical potential, Trustchain has not yet been effectively imple mented for smartphones. To evaluate performance, we provide an implementation over two communication protocols, focusing on throughput. We found that our QUIC-based implementation displays an over three times throughput improvement when keeping a QUIC connection open, and can confidently store at least 28 536-byte blocks per sec ond. However, our UDP-based version outperforms our implementation, confidently storing at least 500 668-byte blocks per second.