Abstract The introduction of blockchain technology has brought about significant transformation in the realm of digital transactions, providing a secure and transparent platform for peer-to-peer interactions that cannot be tampered with. The decentralised and distributed nature of blockchains guarantees the integrity and authenticity of the data, eliminating the need for intermediaries. The applications of this technology are not limited to the financial sector, but extend to various areas, such as supply chain management, identity verification, and governance. At the core of these blockchains is the consensus mechanism, which plays a crucial role in ensuring the reliability and integrity of a system. Consensus mechanisms are essential for achieving an agreement amongst network participants regarding the validity of transactions and the order in which they are recorded on the blockchain. By incorporating consensus mechanisms, blockchains ensure that all honest nodes in the network reach a consensus on whether to accept or reject a block, based on predefined rules and criteria. The aim of this study is to introduce a novel consensus mechanism named Erdos, which seeks to address the shortcomings of existing consensus algorithms, such as the Proof of Work and Proof of Stake. Erdos emphasises security, decentralisation, and fairness. One notable feature of this mechanism is its equitable node-selection algorithm, which ensures equal opportunities for all nodes to engage in block creation and validation. In addition, Erdos implements a deterministic block finalisation process that guarantees the integrity and authenticity of the blockchain. The main contribution of this research lies in its innovative approach to deterministic block finalisation, which effectively mitigates the various security risks associated with blockchain systems.
Blockchain deployments require efficient consensus models in order to be scaled for larger networks. Existing consensus models either use stake-levels, trust-levels, authority-levels, etc. or their combinations in order to reduce mining delay while maintaining higher security levels. But these models either have higher energy requirements, lower security, or have linear/exponential relationship between mining delay and length of the chains. Due to these restrictions, the applicability of these models is affected when deployed under real-time network scenarios. To overcome these issues, this text proposes design of an efficient novel trust-based hybrid consensus model for securing blockchain deployments. The proposed model initially uses a hybrid consensus model that fuses Proof-of-Work (PoW), Proof-of-Stake (PoS) with Proof-of-Temporal-Trust (PoTT) for improving security while maintaining higher Quality of Service (QoS) levels. The PoTT Model fuses together temporal mining delay, temporal mining energy, throughput and block mining efficiency in order to generate miner-level trusts. These trust values are fused with Work efficiency and Stake levels and used for selection of miners. The selected miners are used for serving block addition requests, which assists in improving mining speed by 3.2%, reducing energy consumption 4.5%, and improving throughput by 8.5%, while improving block mining efficiency by 2.9% when compared with existing mining optimization models. This performance was validated under Sybil, Finney, Man-in-the-Middle, and Spoofing attacks. Performance of the model was observed to be consistent even under attacks, thereby making it useful for real-time network scenarios.
Avni Rustemi, Fisnik Dalipi, Vladimir Atanasovski, Aleksandar Risteski
Abstract Nowadays, the centralized systems used in higher education institutions are sophisticated and have high security mechanisms, offering secure data transfer and real-time encryption. Despite the prevalent usage of centralized systems in many institutions, particularly those within the realm of higher education, some unresolved concerns persist pertaining to privacy, potential abuse, transparency, and the limited capacity to digitize numerous services. Blockchain systems are considered as a potential solution for addressing these constraints. This study begins by highlighting the significance of implementing blockchain systems in higher education institutions, while also outlining the obstacles encountered by researchers in this domain. Centralized systems and blockchain systems are distinguished, with a description of the challenges related to data transfer and adaptation to different platforms. A thorough explanation of the proposed blockchain system begins with a presentation of the conceptual model, followed by a detailed architecture of the processes that would be executed by the system, with particular emphasis on the generation and authentication of academic credentials. Additionally, an analysis is provided on the significance of smart contracts in the programming of blockchain systems. This includes a detailed explanation of the main smart contract architecture used in the proposed blockchain system. This article aims to explore the development of a proposed blockchain system and its practical implementation for testing purposes using specific scenarios and data in the foreseeable future.
O presente artigo emprega a abordagem Kitchenham para realizar um mapeamento sistemático das técnicas de escalonamento presentes na blockchain Ethereum. O estudo focou em analisar as vantagens e desvantagens de sete das soluções mais populares, incluindo: sharding, state channel, sidechains, plasma, validium, rollup zk e otimista. Os resultados indicam que as técnicas mapeadas oferecem benefícios, como aumento da capacidade de transações e redução dos custos. No entanto, também apresentam limitações e riscos que afetam a segurança da rede.
Distributed ledger technology such as blockchain is considered essential for supporting large numbers of micro-transactions in the Machine Economy, which is envisioned to involve billions of connected heterogeneous and decentralized cyber-physical systems. This stresses the need for performance and scalability of distributed ledger technologies. Addressing this, sharding techniques that divide the blockchain network into multiple committees are a common approach to improve scalability. However, with current sharding approaches, costly cross-shard verification is needed to prevent double-spending. This article proposes a novel and more scalable distributed ledger method named ScaleGraph that implements dynamic sharding by using routing and logical proximity concepts from distributed hash tables. ScaleGraph addresses cybersecurity in terms of integrity and availability to support frequent micro-transactions between autonomous devices. Benefits of ScaleGraph include a total storage space complexity of \(O(t)\) , where \( t \) is the global number of transactions (assuming a constant replication degree). This space is sharded over \( N \) nodes so that each node needs \(O(t/N)\) storage in expectation, which provides a high level of concurrency and data localization as compared to other delegated consensus proposals. ScaleGraph allows for a dynamic grouping of validators that are selected based on a distance metric. We analyze the consensus requirements in such a dynamic setting and show that a synchronous consensus protocol allows shards to be smaller than an asynchronous one, and likely yields better performance. Moreover, we provide an experimental analysis of security aspects regarding the required size of the consensus groups with ScaleGraph. Our analysis shows that dynamic sharding based on proximity concepts brings attractive scalability properties in general, especially when the fraction of corrupt nodes is small.
Abstract: In the ever-evolving landscape of distributed systems, ensuring safety, efficiency, and scalability remains a paramount challenge. BlockEdge emerges as a pioneering framework designed to address these critical issues by leveraging the principles of blockchain technology and advanced consensus mechanisms. This abstract outlines the key features, innovations, and potential impacts of BlockEdge on the realm of distributed computing. BlockEdge integrates blockchain's immutable ledger properties with a novel consensus algorithm tailored for distributed systems. Unlike traditional blockchain applications that prioritize decentralization for financial transactions, BlockEdge focuses on enhancing the performance and reliability of distributed applications. The framework employs a hybrid consensus model that combines Byzantine Fault Tolerance (BFT) with Proof-of-Stake (PoS), optimizing both security and energy efficiency. A standout feature of BlockEdge is its modular architecture, which allows seamless interoperability between different types of distributed networks. This modularity facilitates the integration of various consensus protocols, catering to the specific needs of diverse applications, from IoT networks to large-scale data processing systems. By enabling secure and efficient cross-chain communication, BlockEdge effectively mitigates the silo effect prevalent in current distributed system designs.
Zheyuan He, Zihao Li, Ao Qiao, Xiapu Luo · 9 authors
Blockchains, with intricate architectures, encompass various components, e.g., consensus network, smart contracts, decentralized applications, and auxiliary services. While offering numerous advantages, these components expose various attack surfaces, leading to severe threats to blockchains. In this study, we unveil a novel attack surface, i.e., the state storage, in blockchains. The state storage, based on the Merkle Patricia Trie, plays a crucial role in maintaining blockchain state. Besides, we design Nurgle, the first Denial-of-Service attack targeting the state storage. By proliferating intermediate nodes within the state storage, Nurgle forces blockchains to expend additional resources on state maintenance and verification, impairing their performance. We conduct a comprehensive and systematic evaluation of Nurgle, including the factors affecting it, its impact on blockchains, its financial cost, and practically demonstrating the resulting damage to blockchains. The implications of Nurgle extend beyond the performance degradation of blockchains, potentially reducing trust in them and the value of their cryptocurrencies. Additionally, we further discuss three feasible mitigations against Nurgle. At the time of writing, the vulnerability exploited by Nurgle has been confirmed by six mainstream blockchains, and we received thousands of USD bounty from them.
The closed architecture of prevailing blockchain systems renders the usage of this technology mostly infeasible for a wide range of real-world problems. Most blockchains trap users and applications in their isolated space without the possibility of cooperating or switching to other blockchains. Therefore, blockchains need additional mechanisms for seamless communication and arbitrary data exchange between each other and external systems. Unfortunately, current approaches for cross-blockchain communication are resource-intensive or require additional blockchains or tailored solutions depending on the applied consensus mechanisms of the connected blockchains. Therefore, we propose an oracle with an off-chain aggregation mechanism based on Zero-Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) to facilitate cross-blockchain communication. The oracle queries data from another blockchain and applies a rollup-like mechanism to move state and computation off-chain. The zkOracle contract only expects the transferred data, an updated state root, and proof of the correct execution of the aggregation mechanism. The proposed solution only requires constant 378 kgas to submit data on the Ethereum blockchain and is primarily independent of the underlying technology of the queried blockchains.
The dynamic and unpredictable nature of network environments poses a significant challenge for distributed systems, particularly those relying on consensus algorithms for state management and fault tolerance. To address this challenge, this article introduces a novel simulation model designed to study the impact of unstable network connections on clusters running consensus algorithms. The model is engineered to mimic varying degrees of network instability, including latency fluctuations and connection disruptions, which are characteristic of real-world distributed systems. Our proposed model represents a significant advancement in the simulation of distributed networks. It employs a sophisticated network emulation layer capable of generating a wide spectrum of unstable network conditions. The core of the model is a highly configurable consensus mechanism simulator that allows for the adjustment of key parameters such as heartbeat intervals, election timeouts, and message loss rates. This level of configurability enables a comprehensive analysis of consensus behaviors under different network scenarios. The article focuses on the methodology behind the development of the model, detailing the theoretical underpinnings and the implementation strategies used to ensure a realistic representation of network instability. We also discuss the potential applications of the model, which extend beyond academic research into practical domains where distributed ledger technologies and distributed databases are prevalent. Through the deployment of this model, researchers and system architects can gain deeper insights into the resilience and adaptability of consensus algorithms. The model serves as a tool for preemptively identifying and addressing potential issues in distributed systems, facilitating the development of more robust and reliable technologies. In summary, the article showcases the design and capabilities of a new model that enables an in-depth understanding of the delicate interplay between network instability and consensus efficiency. By focusing on the model itself, the article aims to lay a foundation for future studies and improvements in the field of distributed systems.
Jummai Enare Abang, Haifa Takruri, Rabab Al-Zaidi, Mohammed Al-Khalidi
Blockchain is a decentralized and distributed ledger technology that enables secure and transparent recording of transactions across multiple participants. Hyperledger Fabric (HLF), a permissioned blockchain, enhances performance through its modular design and pluggable consensus. However, integrating HLF with enterprise applications introduces latency challenges. Researchers have proposed numerous latency performance modelling techniques to address this issue. These studies contribute to a deeper understanding of HLF’s latency by employing various modelling approaches and exploring techniques to improve network latency. However, existing HLF latency modelling studies lack an analysis of how these research efforts apply to specific use cases. This paper examines existing research on latency performance modelling in HLF and the challenges of applying these models to HLF-enabled Internet of Things (IoT) use cases. We propose a novel set of criteria for evaluating HLF latency performance modelling and highlight key HLF parameters that influence latency, aligning them with our evaluation criteria. We then classify existing papers based on their focus on latency modelling and the criteria they address. Additionally, we provide a comprehensive overview of latency performance modelling from various researchers, emphasizing the challenges in adapting these models to HLF-enabled IoT blockchain within the framework of our evaluation criteria. Finally, we suggest directions for future research and highlight open research questions for further exploration.
Sergio Demian Lerner, Ramon Amela, Shreemoy Mishra, Martin Jonáš · 5 authors
BitVMX is a new design for a virtual CPU to optimistically execute arbitrary programs on Bitcoin based on a challenge response game introduced in BitVM. Similar to BitVM1 we create a general-purpose CPU to be verified in Bitcoin script. Our design supports common architectures, such as RISC-V or MIPS. Our main contribution to the state of the art is a design that uses hash chains of program traces, memory mapped registers, and a new challenge-response protocol. We present a new message linking protocol as a means to allow authenticated communication between the participants. This protocol emulates stateful smart contracts by sharing state between transactions. This provides a basis for our verification game which uses a graph of pre-signed transactions to support challenge-response interactions. In case of a dispute, the hash chain of program trace is used with selective pre-signed transactions to locate (via $n$-ary search) and then recover the precise nature of errors in the computation. Unlike BitVM1, our approach does not require the creation of Merkle trees for CPU instructions or memory words. Additionally, it does not rely on signature equivocations. These differences help avoid complexities associated with BitVM1 and make BitVMX a compelling alternative to BitVM2. Our approach is quite flexible, BitVMX can be instantiated to balance transaction cost vs round complexity, prover cost vs verifier cost, and precomputations vs round complexity.
Ethereum 2.0 is the second-largest cryptocurrency by market capitalization and a widely used smart contract platform. Therefore, examining the reliability of Ethereum 2.0's incentive mechanism is crucial, particularly its effectiveness in encouraging validators to adhere to the Ethereum 2.0's protocol. This paper studies the incentive mechanism of Ethereum 2.0 and evaluates its robustness by analyzing the interaction between block proposers and attesters in a single slot. To this end, we use Bayesian games to model the strategies of block proposers and attesters and calculate their expected utilities. Our results demonstrate that the Ethereum 2.0 incentive mechanism is incentive-compatible and promotes cooperation among validators. We prove that a Bayesian Nash equilibrium and an ex ante dominant strategy exist between the block proposer and attesters in a single slot. Our research provides a solid foundation for further analysis of Ethereum 2.0's incentive mechanism and insights for individuals considering participation as a validator in Ethereum 2.0.
Cooperation among telecom carriers and datacenter (DC) providers (DCPs) is essential to ensure resiliency of network-cloud ecosystems. To enable efficient cooperative recovery in case of resource crunch, e.g., due to traffic congestion or network failures, we previously studied several frameworks for cooperative recovery among different stakeholders (e.g., telecom carriers and DCPs). Now, we introduce a novel Multi-entity Cooperation Platform (MCP) for implementing cooperative recovery planning, to achieve efficient use of carriers' valuable optical-network resources during recovery. We adopt a Distributed Ledger Technology (DLT) that ensures decentralized and tamper-proof information exchange among stakeholders to achieve open and fair cooperation. To support diverse types of cooperation, we develop a state machine representing the MCP operation and define state transitions associated to stakeholders' cooperation within the state machine. Moreover, we propose a signaling system in MCP to ensure simple and reliable state transitions for stakeholders during the cooperative recovery planning in large ecosystems. We experimentally demonstrate a proof-of-concept DLT-based MCP on a testbed. We showcase a DCP-carrier cooperative planning process, showing the flexibility of the proposed MCP to support diverse types of cooperation.
In today's digital landscape, the exponential growth of big data demands secure and efficient processing, particularly in complex multi-cloud environments. This paper proposes an innovative blockchain-enabled data governance framework, revolutionizing data management, processing, and security across diverse cloud infrastructures. The framework integrates cutting-edge technologies, including the Ethereum blockchain, the InterPlanetary File System (IPFS) protocol, and cloud solutions like OpenStack and Red Hat OpenShift. At its core, the framework utilizes Ethereum's robust smart contracts and consensus mechanisms to establish a decentralized and secure data governance model. This ensures data integrity, transparency, and immutability, mitigating risks associated with centralized storage and processing. The IPFS protocol complements blockchain by offering efficient data sharding and retrieval mechanisms, enhancing data accessibility and fault tolerance in distributed cloud environments. Through comprehensive testing and analysis, the proposed framework's value is demonstrated. Performance metrics, including throughput, latency, CPU utilization, and memory utilization, were meticulously evaluated to assess system efficiency and scalability. Results indicate high performance, with Ethereum's Proof of Authority (PoA) consensus mechanism enabling efficient transaction throughput of up to 1000 transactions per second. Additionally, the IPFS protocol exhibits effective data retrieval capabilities, with an average latency of 15 milliseconds for data access operations.
Elitsa Pankovska, Ashish Rajendra Sai, Harald Vranken, Alan Ransil
The high electricity consumption of cryptocurrencies that rely on proof-of-work (PoW) consensus algorithms has raised serious environmental concerns due to its association with carbon emissions and strain on energy grids. There has been significant research into estimating the electricity consumption of PoW-based cryptocurrencies and developing alternatives to PoW. In this article, we introduce refined models to estimate the electricity consumption of two prominent alternatives: Ethereum, now utilizing proof-of-stake (PoS), and Filecoin, which employs proof-of-spacetime (PoSt). Ethereum stands as a leading blockchain platform for crafting decentralized applications, whereas Filecoin is recognized as the world's foremost decentralized data storage network. Prior studies for modeling electricity consumption have been criticized for methodological flaws and shortcomings, low-quality data, and unvalidated assumptions. We improve on this in several ways: we obtain more novel, validated data from the systems in question, extract information from existing data and research, and we improve transparency and reproducibility by clearly explaining and documenting the used methodology and explicitly stating unavoidable limitations and assumptions made. When comparing the current, most prominent models for Ethereum and Filecoin to our refined models, we find that given the wide error margins of both the refined models and the ones introduced in prior literature, the resulting average estimates are to a large extent in line with each other.
Rahmanul Hoque, Md. Maniruzzaman, Daniel Lucky Michael, Mahmudul Hoque
This paper introduces BlockNIC, an innovative blockchain infrastructure designed to operate exclusively on SmartNICs. Unlike traditional blockchain implementations, BlockNIC leverages the unique capabilities of SmartNICs to execute relatively simple computations directly on the network path, eliminating the need for additional hardware and reducing reliance on host CPUs. By harnessing idle resources within the network, BlockNIC significantly reduces energy consumption and hardware requirements, addressing the environmental concerns associated with conventional blockchain architectures. Through comprehensive performance comparisons between SmartNICs and bare-metal servers, this study demonstrates the promising potential of BlockNIC in achieving scalability, security, and environmental sustainability in blockchain networks. The findings highlight BlockNIC's ability to enhance overall performance and reliability while minimizing resource limitations, thereby unlocking new possibilities for various applications and use cases previously hindered by energy and hardware constraints. The emergence of BlockNIC aligns with the global sustainability agenda, offering a timely solution to the environmental challenges posed by traditional blockchain technologies. By promoting the adoption of SmartNIC-based blockchain infrastructures, this research contributes to a greener and more secure digital future. It emphasizes the importance of exploring innovative approaches to address the environmental impact of technological innovations, urging researchers, industry professionals, and policymakers to recognize the transformative potential of SmartNIC-based solutions in advancing sustainability and efficiency in blockchain ecosystems.
Naveen Arali, D. G. Narayan, Altaf Husain M., P. S. Hiremath
Blockchain technology is a decentralized ledger system that finds applications in various domains such as banking, e-governance, and supply chain management. The consensus algorithm plays a crucial role in any blockchain network as it directly impacts the network's performance and security. There have been several proposed consensus mechanisms in the literature, including Proof of Work (PoW), Proof of Stake (PoS), Robust Proof of Stake (RPoS), and Delegated Proof of Stake (DPoS). Both Ethereum and Bitcoin utilize the PoW consensus mechanism, where nodes compete to solve puzzles in order to generate blocks, consuming significant processing power. On the other hand, the PoS consensus mechanism selects miners based on the stakes they hold, making it more energy efficient. However, PoS has drawbacks such as vulnerability to coin age accumulation attacks and the potential for partial centralization. In this work, we present a consensus mechanism known as Delegated Proof of Stake with Downgrading Mechanism using Game Theory (DDPoS (GT)). This mechanism employs a two-step game strategy to divide nodes into strong and weak nodes, as well as attack and non-attack nodes. Later, the results of the two games are combined to enhance protocol efficiency and security. Experimental results using a private Ethereum-based network demonstrate that DDPoS (GT) performs better than PoS and DPoS in terms of transaction latency, average block waiting time, and fairness.
The Proof-of-Work algorithm that underlies Bitcoin, Ethereum w , 1 and many other cryptocurrencies is well known for its energy-intensive requirements. The Proof-of-Stake algorithm that underlies Ethereum and various other cryptocurrencies is less impactful environmentally, but it has a second, looming issue: the problem of wealth inequality. We have developed an alternative to Proof-of-Work and Proof-of-Stake, called Proof-by-Location, that has the potential to address both of these issues. This article describes Proof-by-Location and a financial platform called Xylem that is based on it. This platform seeks to distribute transaction fees to billions of cryptocurrency “Notaries” around the world (essentially, anyone with a smartphone), who work together to establish a distributed consensus about financial transactions. In this article, we demonstrate that this platform can scale to more than 3.9 trillion transactions per year (more than triple the number of digital payments per year currently occurring). We show a reduction of electricity usage per transaction of 99.9999914% compared to Bitcoin, 99.999905% compared to Ethereum w , 99.83% compared to Ethereum, and 95.9% compared to the Visa financial services company. We demonstrate that this platform would have a redistributive rather than consolidatory effect on wealth compared to any of these platforms, leading to a source of income for more than 1 billion people around the world, including more than 110 million in the bottom 10th to 20th percentile by income, with income for that group equivalent to 8.8 million full-time jobs. Finally, this currency provides a positive, non-compulsory mechanism for shaping human habitation patterns in ways that can slow global biodiversity loss and enable ecological restoration. Using Xylem as a global financial infrastructure could lead to significantly better social and environmental outcomes than existing financial platforms. 2
Software Development based on Scrum Agile in a distributed development environment plays a pivotal role in the contemporary software industry by facilitating software development across geographic boundaries. However, in the past different frameworks utilized to address the challenges like communication and collaboration in scrum agile distributed software development (SADSD) were notably inadequate in transparency, security, traceability, geographically dispersed location work agreements, geographically dispersed teamwork effectiveness, and trust. These deficiencies frequently resulted in delays in software development and deployment, customer dissatisfaction, canceled agreements, project failures, and disputes over payments between customers and development teams. To address these challenges of SADSD, this paper proposes a new framework called ChainAgile, which leverages blockchain technology. ChainAgile employs a private Ethereum blockchain to facilitate the execution of smart contracts. These smart contracts cover a range of functions, including acceptance testing, secure payments, requirement verification, task prioritization, sprint backlog, user story design and development and payments with the automated distribution of payments via digital wallets to development teams. Moreover, in the ChainAgile framework, smart contracts also play a pivotal role in automatically imposing penalties on customers for making late payments or for no payments and penalties on developers for completing the tasks that exceed their deadlines. Furthermore, ChainAgile effectively addresses the scalability limitations intrinsic in blockchain technology by incorporating the Interplanetary File System (IPFS) is used for storage solutions as an off-chain mechanism. The experimental results conclusively show that this innovative approach substantially improves transparency, traceability, coordination, communication, security, and trust for both customers and developers engaged in scrum agile distributed software development (SADSD).
Abstract Blockchain infrastructures have emerged as a disruptive technology and have led to the realization of cryptocurrencies (peer‐to‐peer payment systems) and smart contracts. They can have a wide range of application areas in e‐Science due to their open, public nature and global accessability in a trustless manner. We propose and implement a smart contract called eBlocBroker, which is an autonomous blockchain‐based middleware system for volunteer computing and providing data resources for e‐Science. The eBlocBroker infrastructure connects requesters who need to combine applications (jobs) with datasets and run them via an Ethereum‐based private blockchain network (Bloxberg) on providers that utilize computational and data resources on clouds or home servers. It uses cloud storage, such as B2DROP, IPFS, or Google Drive, to store and transfer data between requesters and providers. Each provider utilizes the Slurm workload manager to execute jobs submitted through eBlocBroker. In this paper, we demonstrate how an autonomous organization programmed as a smart contract can be used to deploy a marketplace that supports data and computation‐intensive research projects. We propose a cost model implemented as a function in the smart contract which calculates and records computation and dataset usage costs. We develop a Python‐based system to communicate with eBlocBroker and orchestrate jobs' execution on the provider's end. We present eBlocBroker's features, infrastructure, implementation, algorithms and experimental results.
The scalability limitations of public blockchains have hindered their widespread adoption in real-world applications. While the Ethereum community is pushing forward in zk-rollup (zero-knowledge rollup) solutions, such as introducing the ``blob transaction'' in EIP-4844, Layer 2 networks encounter a data availability problem: storing transactions completely off-chain poses a risk of data loss, particularly when Layer 2 nodes are untrusted. Additionally, building Layer 2 blocks requires significant computational power, compromising the decentralization aspect of Layer 2 networks. This paper introduces new techniques to address the data availability and decentralization challenges in Layer 2 networks. To ensure data availability, we introduce the concept of ``proof of download'', which ensures that Layer 2 nodes cannot aggregate transactions without downloading historical data. Additionally, we design a ``proof of storage'' scheme that punishes nodes who maliciously delete historical data. For decentralization, we introduce a new role separation for Layer 2, allowing nodes with limited hardware to participate. To further avoid collusion among Layer 2 nodes, we design a ``proof of luck'' scheme, which also provides robust protection against maximal extractable value (MEV) attacks. Experimental results show our techniques not only ensure data availability but also improve overall network efficiency, which implies the practicality and potential of our techniques for real-world implementation.
Blockchain technology has been successfully applied in recent years to promote the immutability, traceability, and authenticity of previously collected and stored data. However, the amount of data stored in the blockchain is usually limited for economic and technological issues. Namely, the blockchain usually stores only a fingerprint of data, such as the hash of data, while full, raw information is stored off-chain. This is generally enough to guarantee immutability and traceability, but misses to support another important property, that is, data availability. This is particularly true when a traditional, centralized database is chosen for off-chain storage. For this reason, many proposals try to properly combine blockchain with decentralized IPFS storage. However, the storage of data on IPFS could pose some privacy problems. This paper proposes a solution that properly combines blockchain, IPFS, and encryption techniques to guarantee immutability, traceability, availability, and data privacy.
Oleksandr Kuznetsov, Dzianis Kanonik, Alex Rusnak, Anton Yezhov · 6 authors
The scalability of blockchain technology remains a pivotal challenge, impeding its widespread adoption across various sectors. This study introduces an innovative approach to address this challenge by proposing the adaptive restructuring of Merkle and Verkle trees, fundamental components of blockchain architecture responsible for ensuring data integrity and facilitating efficient verification processes. Unlike traditional static tree structures, our adaptive model dynamically adjusts the configuration of these trees based on usage patterns, significantly reducing the average path length required for verification and, consequently, the computational overhead associated with these processes. Through a comprehensive conceptual framework, we delineate the methodology for adaptive restructuring, encompassing both binary and non-binary tree configurations. This framework is validated through a series of detailed examples, demonstrating the practical feasibility and the efficiency gains achievable with our approach. Moreover, we present a comparative analysis with existing scalability solutions, highlighting the unique advantages of adaptive restructuring in terms of simplicity, security, and efficiency enhancement without introducing additional complexities or dependencies. This study's implications extend beyond theoretical advancements, offering a scalable, secure, and efficient method for blockchain data verification that could facilitate broader adoption of blockchain technology in finance, supply chain management, and beyond. As the blockchain ecosystem continues to evolve, the principles and methodologies outlined herein are poised to contribute significantly to its growth and maturity.