The InterPlanetary File System (IPFS) has emerged in 2015 as a promising peerto-peer (P2P) distributed file-sharing system poised to become the backbone of Web3.However, its BitSwap protocol, responsible for block exchange, encounters redundancy issues when multiple peers respond with duplicate blocks.To address this limitation, we propose CodedBitSwap, an innovative network coding-based data exchange protocol that integrates Random Linear Network Coding (RLNC) into BitSwap.Considering that RLNC operations incur additional computational overhead, the RLNC-based protocol is designed with careful attention to its computational complexity that is investigated through trial experiments guiding the selection of coding parameters and structures.To assess the feasibility and performance of CodedBitSwap, an experimental evaluation that compares it with BitSwap was conducted in different scenarios xv using a controlled testbed environment consisting of 11 nodes exchanging three files of different sizes.During file exchange, the amount of data transmitted, download time, and encoding and decoding times were measured for each node.The evaluation results demonstrate that CodedBitSwap effectively eliminates redundancy at a relatively low cost of increased download time.The introduced RLNC computational complexity was optimized by the generation-based design strategy that minimizes it, ensuring that the cost of the reduced redundancy remains relatively low.The undertaken design methodology of CodedBitSwap offers a practical approach for future systems, which balances the overhead of RLNC coding with the benefits it brings.This work contributes to the advancement of network coding in P2P networks and demonstrates its potential to improve the efficiency of IPFS, opening up avenues for future research.
Blockchain technology holds great potential for the gaming industry, but its inherent complexity can create significant barriers for game developers. Throughput's "Ledger as a Service" (LaaS) solution addresses this challenge, making blockchain technology and its benefits accessible to the gaming sector. By minimizing costs and technical overheads, it allows developers to prioritize building innovative and immersive game experiences. This research presents Throughput, a blockchain platform designed to excel in the gaming environment. Its groundbreaking approach employs a single process to manage multiple ledgers from different blockchains. This maximizes efficiency, reduces complexity, and significantly lowers the costs associated with running a layer 1 blockchain – critical advantages for supporting the resource-intensive nature of games. Throughput's consensus algorithm is carefully engineered to handle the demands of real-time gameplay, ensuring high throughput, minimal latency, and fast transaction confirmations. The ability for a single node to maintain multiple ledgers can be a significant breakthrough and can enable a validator to run multiple blockchains on single node with unified consensus. This efficiency boost not only saves resources but promotes exciting possibilities for interoperability, cross-game collaboration, and seamless asset exchange across different gaming blockchains. Furthermore, Throughput's validators benefit from increased block rewards by validating blocks across multiple ledgers. This unique incentive model encourages the maintenance of a robust and secure network, benefiting the entire gaming ecosystem. In conclusion, Throughput simplifies the integration of blockchain technology for game developers and offers features tailored explicitly to the needs of the gaming industry. By offloading complex node management, Throughput empowers developers to focus on their core strengths – ultimately accelerating the adoption of blockchain in gaming and driving innovation throughout the sector.
This paper examines decentralized governance and DAOs in Web3, emphasizing balanced tokenomics to empower users. It discusses management protocols and optimized grant programs for diverse project support. By citing real-world statistics, it highlights DAO growth and the need to lower cognitive barriers to Web3 entry, aiming to advance security, evolution, and inclusivity in decentralized finance.
This paper presents MindTheDApp, a toolchain designed specifically for the structural analysis of Ethereum-based Decentralized Applications (DApps), with a distinct focus on a complex network-driven approach. Unlike existing tools, our toolchain combines the power of ANTLR4 and Abstract Syntax Tree (AST) traversal techniques to transform the architecture and interactions within smart contracts into a specialized bipartite graph. This enables advanced network analytics to highlight operational efficiencies within the DApp’s architecture. The bipartite graph generated by the proposed tool comprises two sets of nodes: one representing smart contracts, interfaces, and libraries, and the other including functions, events, and modifiers. Edges in the graph connect functions to smart contracts they interact with, offering a granular view of interdependencies and execution flow within the DApp. This network-centric approach allows researchers and practitioners to apply complex network theory in understanding the robustness, adaptability, and intricacies of decentralized systems. Our work contributes to the enhancement of security in smart contracts by allowing the visualisation of the network, and it provides a deep understanding of the architecture and operational logic within DApps. Given the growing importance of smart contracts in the blockchain ecosystem and the emerging application of complex network theory in technology, our toolchain offers a timely contribution to both academic research and practical applications in the field of blockchain technology.
Many businesses seeking new capabilities that blockchains may offer are deterred from fully embracing the technology due to fears of the classic "vendor lock-in" and platform-capture into one specific blockchain. From an asset-centric perspective, most business applications seek certain desirable functional guarantees with regard to the state of the tokenized asset on the blockchain. These new capabilities must be accessible through standardized service interfaces. The emerging tokenized asset networks based on decentralized ledger technology must integrate seamlessly into existing financial IT systems through similar standard interfaces. As such, if blockchains are to be a foundational technology in the future Web3 Internet of Value, then several classes and types of standardized APIs must be specified, published, and widely deployed by the nascent tokenized asset industry. These standard APIs must provide business applications with a single uniform interface to the many and varied blockchains today, thereby reducing business IT costs and preventing platform-capture.
Ethereum is undergoing significant changes to its architecture as it evolves. These changes include its switch to PoS consensus and the introduction of significant infrastructural changes that do not require a change to the core protocol, but that fundamentally affect the way users interact with the network. These changes represent an evolution toward a more modular architecture, in which there exists new exogenous vectors for centralization. This paper builds on previous studies of decentralization of Ethereum to reflect these recent significant changes, and Ethereum's new modular paradigm.
Sarah A. Flanery, Kamalesh Mohanasundar, Christiana Chamon, Srujan Kotikela · 5 authors
With the natural evolution of the web, the need for decentralization has rendered the current centralized education system out of date. The student does not "own" their credentials, as the only way their accomplishments are directly linked to their person and considered valuable is by verification through a stamp of an expensive, prestigious institution. However, going to a university is no longer the only way to acquire an education; open-source learning material is widely available and accessible through the internet. However, our society does not deem these methods of education as verifiable if they do not include a degree or certificate. Additionally, a valid certificate for the vast majority of open-source courses costs a few hundred dollars to obtain. The centralized nature of education inadvertently places students in underprivileged communities at a disadvantage in comparison to students in economically advantaged communities, thus a decentralized approach to education would eliminate the vast majority of such discrepancies. In the present paper, we integrate Decentralized Identity (DID) with Web 3.0 to upload credentials linked directly to the user. Each credential is appended to an Ethereum blockchain that, by design, cannot be altered once uploaded. We include DID document based access controls to display the candidate's upload and verification history. Finally, we utilize TLS protocols to provide a secure connection to the internet for ensuring non-fungibility of credentials and authentication of users.
The e-book services we use today have a serious drawback in that we will no longer be able to read the books we have purchased when the service is terminated. One way to solve this problem is to build a decentralized system that does not depend on a specific company or organization by combining smart contracts running on the Ethereum blockchain and distributed storage such as an IPFS. However, a simple combination of existing technologies does not make the stored e-book data persistent, so the risk of purchased e-books becoming unreadable remains. In this paper, we propose a decentralized distributed storage called d-book-repository, which has both access management function and data durability for purchased e-books. This system uses NFTs as access rights to realize strict access control by preventing clients who do not have NFTs from downloading e-book data. In addition, e-book data stored on storage nodes in the distributed storage is divided into shards using Reed–Solomon codes, and each storage node stores only a single shard, thereby preventing the creation of nodes that can restore the entire content from locally stored data. The storage of each shard is not handled by a single node but by a group of nodes, and the shard is propagated to all nodes in the group using the gossip protocol, where erasure codes are utilized to increase the resilience against node departure. Furthermore, an incentive mechanism to encourage participation as a storage node is implemented using smart contracts. We built a prototype of the proposed system on AWS and evaluated its performance. The results showed that both downloading and uploading 100 MB of e-book data (equivalent to one comic book) were completed within 10 s using an instance type of m5.xlarge. This value is only 1.3 s longer for downloading and 2.2 s longer for uploading than the time required for a simple download/upload without access control, confirming that the overhead associated with the proposed method is sufficiently small.
The social network Twitter possesses a key characteristic: it is centralized, allowing Twitter Corporation to control data substitution and set moderation rules. However, this issue can only be resolved through the complete decentralization of the platform. To achieve this, blockchain technology is crucial as it enables the operation of decentralized applications with smart contracts serving as the foundation for system-user interaction. In this paper, we propose the minimum viable implementation of a similar social network called Brain Logger, which stores all necessary data in the NEAR blockchain network. Introducing a small fee for modifying data on the network ensures a solution to the aforementioned problems. The implementation includes a smart contract for blockchain networks and a web application frontend. The smart contract was developed using the NEAR software development kit in Rust, while the frontend was created in JavaScript using the React framework and Redux for local data storage. The code can be accessed on Github.
Saidu Sokoto, Michał Król, Vladimir Stanković, Étienne Rivière
Distributed Hash Tables (DHTs) serve as the backbone of numerous modern decentralized systems like the InterPlanetary File System (IPFS) and Ethereum. As these systems evolve and expand, there is a growing need to enhance and optimize their underlying network support. In response to these challenges, we embark on the development of a new class of DHTs, marked by efficiency, security, and suitability for real-world deployments. We achieve this by making changes in the routing procedures, incorporating latency-aware routing, and harnessing recent hardware advancements.
Web3, the next generation of the Internet, represents a decentralized and democratized web. Although it has garnered significant public interest and found numerous real-world applications, there is a limited understanding of people's perceptions and experiences with Web3. In this study, we conducted an empirical study to investigate the categories of Web3 applications and their popularity, as well as the potential challenges and opportunities within this emerging landscape. Our research was carried out in two phases. In the first phase, we analyzed 200 popular Web3 projects associated with 10 leading Web3 venture capital firms. In the second phase, we collected and examined code-related data from GitHub and market-related data from blockchain browsers (e.g., Etherscan) for these projects. Our analysis revealed that the Web3 ecosystem can be categorized into two groups, i.e., Web3 infrastructure and Web3 applications, with each consisting of several subcategories or subdomains. We also gained insights into the popularity of these Web3 projects at both the code and market levels and pointed out the challenges in the Web3 ecosystem at the system, developer, and user levels, as well as the opportunities it presents. Our findings contribute to a better understanding of Web3 for researchers and developers, which in turn promotes further exploration and advancement in this innovative field.
The promise of a fully decentralized web is too big to ignore. The bridging of Web2 and Web3 infrastructure is crucial for realizing this decentralized future. However, the current computational and storage demands in blockchain systems often result in challenges for users, leading to reliance on centralized endpoint API services in Web3 application designs. This dependence raises concerns about privacy, availability, and security. This doctoral study aims to enhance the accessibility and decentralization of blockchains, especially by facilitating the participation of resource-constrained devices such as smartphones and browsers. The goal is to facilitate the widespread adoption of decentralized systems that are secure, reliable, and scalable.
Flaviene Scheidt de Cristo, Wazen M. Shbair, Lucian Trestioreanu, Radu State
The XRP Ledger is one of the oldest and most well-established blockchains, using a particular type of consensus mechanism that differs from the typical Proof of Work and Proof of Stake. The underlying p2p network uses flooding to dis-seminate certain types of messages during the consensus rounds, leading to performance and scalability issues. In this work, we propose the use of publisher/subscriber dissemination on the XRPL using GossipSub to diminish the message overhead. We use Flexi-pipe, a tool that allows integration between the XRPL validator and GossipSub, to evaluate the improvements brought.
We present and analyze an attack on Ethereum 1's consensus mechanism, which allows miners to obtain higher mining rewards compared to their honest peers. This attack is novel in that it relies on manipulating block timestamps and the difficulty-adjustment algorithm (DAA) to give the miner an advantage whenever block races ensue. We call our attack Uncle Maker, as it induces a higher rate of uncle blocks. We describe several variants of the attack. Among these, one that is risk-free for miners.
Yang Liu, Zhiyuan Lin, Yuxi Zhang, Lin Jiang · 5 authors
Ethereum, currently the most widely utilized smart contracts platform, anchors the security of myriad smart contracts upon its own robustness. Its foundational peer-to-peer network facilitates a dependable node connection mechanism, whereas an efficient data-sharing protocol constitutes as the bedrock of Blockchain network security. In this paper, we propose NodeHunter, an Ethereum network detector implemented through the application of simulation technology, which is capable of aggregating all node records within the network and the interconnectedness between them. Utilizing this connection information, NodeHunter can procure more comprehensive insights for network status analysis compared to preceding detection methodologies. Throughout a three-month period of unbroken surveillance of the Ethereum network, we obtained an excess of two million node records along with over one hundred million node acquaintances. Analysis of the gathered data revealed that an alarming 49% or more of these node records were maliciously forged.
Abstract Distributed ledgers, including blockchain and other decentralized databases, are designed to store information online where all trusted network members can update the data with transparency. The dynamics of a ledger’s development can be mathematically represented by a directed acyclic graph (DAG). In this paper, we study a DAG model that considers batch arrivals and random delay of attachment. We analyze the asymptotic behavior of this model by letting the arrival rate go to infinity and the inter-arrival time go to zero. We establish that the number of leaves in the DAG, as well as various random variables characterizing the vertices in the DAG, can be approximated by its fluid limit, represented as the solution to a set of delayed partial differential equations. Furthermore, we establish the stable state of this fluid limit and validate our findings through simulations.
Mainstream blockchain games have drawn criticism for prioritizing economic systems over gameplay experience. Influenced by these economically-centered games, existing research on blockchain games predominantly focuses on the financial sector. We have developed BranchClash, a fully on-chain tower defense game on the Sepolia testnet of Ethereum. It introduces chain collaboration, a novel non-economically-centered game mechanism inspired by blockchain technology. BranchClash aims to expand unique game mechanics in blockchain games and explore innovative cooperative modes within the decentralized ecosystem.
Blockchain technology has gained popularity in various applications, including finance transactions and beyond. However, developing blockchain application systems is challenging due to stringent quality requirements, such as performance, scalability, and security. Software architecture plays a critical role in realizing key quality requirements. Nonetheless, little work has been performed on software architectures for blockchain applications since blockchain application development is still a new field. This paper proposes twelve architectural patterns for blockchain application software architectures based on 400 cross-industry real-world applications available on the Internet. We determine the key components of each application guided by a blockchain application taxonomy we developed. We then identify typical architectural patterns from the interactions of these components guided by well-known software patterns, such as peer-to-peer, layered, pipe-filter, and access control. Based on the roles of these patterns, we organize them into four architectural views comprising four structural, two interactional, four transactional, and two security patterns. We describe each pattern in detail using a standard form and demonstrate the patterns through a real-world blockchain application. The use of patterns can be valuable in addressing blockchain’s unique challenges, but creativity remains essential in crafting innovative solutions. Mixing architectural patterns according to varying requirements can help developers communicate effectively.
The broad topic of this thesis is the design and analysis of Bitcoin custody systems. Both the technology and threat landscape are evolving constantly. Therefore, custody systems, defence strategies, and risk models should be adaptive too. We introduce Bitcoin custody by describing the different types, design principles, phases and functions of custody systems. We review the technology stack of these systems and focus on the fundamentals; key-management and privacy. We present a perspective we call the systems view. It is an attempt to capture the full complexity of a custody system, including technology, people, and processes. We review existing custody systems and standards. We explore Bitcoin covenants. This is a mechanism to enforce constraints on transaction sequences. Although previous work has proposed how to construct and apply Bitcoin covenants, these require modifying the consensus rules of Bitcoin, a notoriously difficult task. We introduce the first detailed exposition and security analysis of a deleted-key covenant protocol, which is compatible with current consensus rules. We demonstrate a range of security models for deleted-key covenants which seem practical, in particular, when applied in autonomous (user-controlled) custody systems. We conclude with a comparative analysis with previous proposals. Covenants are often proclaimed to be an important primitive for custody systems, but no complete design has been proposed to validate that claim. To address this, we propose an autonomous custody system called Ajolote which uses deleted-key covenants to enforce a vault sequence. We evaluate Ajolote with; a model of its state dynamics, a privacy analysis, and a risk model. We propose a threat model for custody systems which captures a realistic attacker for a system with offline devices and user-verification. We perform ceremony analysis to construct the risk model.
This paper presents MindTheDApp, a toolchain designed specifically for the structural analysis of Ethereum-based Decentralized Applications (DApps), with a distinct focus on a complex network-driven approach. Unlike existing tools, our toolchain combines the power of ANTLR4 and Abstract Syntax Tree (AST) traversal techniques to transform the architecture and interactions within smart contracts into a specialized bipartite graph. This enables advanced network analytics to highlight operational efficiencies within the DApp's architecture. The bipartite graph generated by the proposed tool comprises two sets of nodes: one representing smart contracts, interfaces, and libraries, and the other including functions, events, and modifiers. Edges in the graph connect functions to smart contracts they interact with, offering a granular view of interdependencies and execution flow within the DApp. This network-centric approach allows researchers and practitioners to apply complex network theory in understanding the robustness, adaptability, and intricacies of decentralized systems. Our work contributes to the enhancement of security in smart contracts by allowing the visualisation of the network, and it provides a deep understanding of the architecture and operational logic within DApps. Given the growing importance of smart contracts in the blockchain ecosystem and the emerging application of complex network theory in technology, our toolchain offers a timely contribution to both academic research and practical applications in the field of blockchain technology.
Ethereum introduced decentralized applications (DApps) to leverage blockchain's potential, distinct from the cryptocurrency buzz dominating discussions. Ethereum offers a robust platform for DApp development, utilizing the Ethereum Virtual Machine (EVM). With increasing smart contract integration, Ethereum's ecosystem strengthens, as these self-executing contracts govern transactions while ensuring consensus among all participants. In democratic societies, the demand for a transparent and secure electronic voting platform is high. Ethereum, with its expansive network, is an ideal choice for such projects. Our implementation focuses on a decentralized, blockchain-based voting system. Multiple nodes collectively store voting data, ensuring redundancy. In case of node issues, users can access their data from operational nodes, enhancing system reliability. This contrasts with traditional centralized servers, prone to hacking or failures that compromise data accessibility and integrity. Blockchain's immutable data storage prevents tampering, as nodes independently verify each block using cryptographic hash codes. Unauthorized changes trigger immediate alerts, enhancing security and trust in the voting system.
Logging is a critical function to enable auditing and enhance security of distributed applications. This paper describes the design of Mnemosyne, a distributed logger running over Named Data Networking(NDN), to meet this need for NDN-based distributed applications. Mnemosyne assures the immutability of logged events by interlocking all event records in a DAG-based ledger. Mnemosyne provides a high logging throughput and system resiliency against network component failures. We implemented Mnemosyne and evaluated its design through an emulated deployment setting.
Leonhard Balduf, Maciej Korczyński, Onur Ascigil, Navin V. Keizer · 7 authors
Interplanetary Filesystem (IPFS) is one of the largest peer-to-peer filesystems in operation. The network is the default storage layer for Web3 and is being presented as a solution to the centralization of the web. In this paper, we present a large-scale, multi-modal measurement study of the IPFS network. We analyze the topology, the traffic, the content providers and the entry points from the classical Internet. Our measurements show significant centralization in the IPFS network and a high share of nodes hosted in the cloud. We also shed light on the main stakeholders in the ecosystem. We discuss key challenges that might disrupt continuing efforts to decentralize the Web and highlight multiple properties that are creating pressures toward centralization.
Mikel Cortes-Goicoechea, Tarun Mohandas-Daryanani, José L. Muñoz, Leonardo Bautista-Gomez
Modern public blockchains like Ethereum rely on p2p networks to run distributed and censorship-resistant applications. With its wide adoption, it operates as a highly critical public ledger. On its transition to become more scalable and sustainable, shifting to PoS without sacrificing the security and resilience of PoW, Ethereum offers a range of consensus clients to participate in the network. In this paper, we present a methodology to measure the performance of the consensus clients based on the latency to receive messages from the p2p network. The paper includes a study that identifies the incentives and limitations that the network experiences, presenting insights about the latency impact derived from running the software in different locations.