Sr IT Developer, First Horizon Bank, Memphis, TN, USA, Rushikesh Anantrao Deshpande
The article examines methods for optimizing PL/SQL queries in distributed banking databases, emphasizing the transition from static rule-based mechanisms to adaptive, learning-driven architectures. The study’s relevance is defined by the increasing complexity of financial data environments that require real-time consistency, fault tolerance, and intelligent workload distribution. The research synthesizes results from seven recent works published between 2021 and 2025, covering neural cost modeling, heuristic algorithms, hybrid plan enumeration, and visualization-based diagnostics. Special attention is devoted to learned cost models and metaheuristic strategies that enhance selectivity estimation, reduce latency, and stabilize throughput in distributed ledger systems. The methodological framework integrates comparative analysis, systematization, and critical evaluation of hybrid, heuristic, and learning-based optimizers. The findings reveal a multi-layered optimization model that combines probabilistic inference, robust plan selection, and heuristic refinement. The conclusions underscore the practical applicability of adaptive PL/SQL optimization for high-volume banking infrastructures and data-intensive financial analytics.
Distributed Ledger Technologies (DLTs) underpin Digital Circular Economy (DCE) systems that rely on efficient IoT data flows. Shimmer, a DAG-based DLT optimized for IoT, enables feeless transactions with parallel validation through its tip-selection mechanism. On such ledgers, message fragmentation induces a latency–throughput tradeoff as per-block cost rises with parallel validation. Such efficiency lowers energy and congestion, supporting DCE objectives. Yet, end-users cannot control payload size or network load, leading to unpredictable latency and high CPU use on submitting devices, increasing energy consumption. Existing approaches mostly modify ledger internals, overlooking adaptivity or end-user policies. We introduce ABS-TD3, an offline-to-online TD3 agent that receives the total message size and outputs the optimal per-block size for balancing latency and energy-efficient CPU utilization. The agent is pre-trained offline on real data with Retrieval Augmentation and adaptive weights for improved decision making, then transitioned online with prioritized replay and a novelty bonus, balancing exploitation-exploration, yielding stable adaptivity compared to standard RL approaches. ABS-TD3 is implemented on Shimmer and can integrate with future Tangle-based forks of pre-IOTA-Rebased frameworks, exposing the same client-side controls. ABS-TD3 is evaluated on Shimmer by submitting 8 message sizes ranging from 5KB to 100KB, under the 32 KB block-size limit, with 250 iterations per size via IOTA-SDK. Against max, min, random, and fixed-weight baselines, it reduces median latency by about 9 % to 12 % and median CPU utilization by about 12 % to 17 % versus max and random policies, enabling efficient IoT data submission for DCE platforms without altering DLT infrastructure.
S K Sharif, C H Saritha, P. Senthil, Madhavi Pingili · 6 authors
Every business operation worldwide adopts cloud storage solutions since cybersecurity now demands mandatory protection for data security together with integrity management while also ensuring data confidentiality. Cloud storage systems that run from one central platform remain exposed to cyberattacks that lead to two risks: system malfunctions and unapproved system access. This research delivers an unalterable data management system through the application of blockchain-based methods to distributed cloud architectures. Through the combination of smart contracts with distributed ledger technology (DLT) and cryptographic hashing capabilities in blockchain technology data protection and data integrity get enhanced in cloud systems. Research teams develop hybrid blockchain systems by combining several systems using external storage methods to solve scalability issues. Through shading technology integration with hybrid blockchain systems and off-chain storage systems fast transaction execution becomes possible. The setup of distributed control centers employing blockchain technology secures data better because it extends traditional systems by creating comprehensive visibility that detects unauthorized access attempts. Researchers have investigated how blockchain-enabled cloud storage applications protect digital data in this study.
Blockchain technology, particularly Ethereum, has enabled a wide range of decentralized applications but continues to face significant scalability challenges, including high gas fees, limited transaction throughput, and frequent network congestion. This review provides a comprehensive analysis of Ethereum's scalability constraints and critically evaluates current Layer 2 scaling solutions such as Rollups, Plasma, the Lightning Network, and other emerging alternatives. The study conducts a comparative assessment of these mechanisms with respect to decentralization, privacy, and security-core dimensions of the blockchain scalability trilemma. Recent academic contributions, including stochastic models of gas fee behavior and protocolspecific analyses, are examined to provide both theoretical and empirical insights. Emphasis is placed on understanding the architectural advantages of zk-Rollups and their positioning as a leading Layer 2 solution. Quantitative metrics such as transaction throughput benchmarks, privacy, and security capability comparisons are presented to support the evaluation. The findings are intended to inform the design of more scalable, secure, and privacy-preserving Ethereum-compatible architectures.
MegaETH leads the way in blockchain technology. It created the Real-Time Proof of Stake (RTPoS) consensus method. This new approach tackles regular blockchain networks' main speed and scaling issues in regular blockchain networks. It allows fast transaction processing without giving up security or decentralization. Meg+aETH focuses on high output and can handle thousands of transactions per second (TPS). This opens doors for many decentralized apps (dApps) across different fields. A big plus of the Ethereum platform is how MegaETH fits into the Ethereum ecosystem. It uses smart contract features and works well with the Ethereum Virtual Machine (EVM). This compatibility helps the ecosystem grow and brings new ideas by making it easier for more developers to join in. MegaETH also cares about the environment. Its design uses less energy, meaning it has less impact on nature than proof-of-work systems. MegaETH brings together efficiency, security, and the ability to grow. This sets a new bar for real-time blockchain apps. As a result, it speeds up how the economy takes on decentralized solutions. It also lets developers and companies explore new ways to use this technique.
Ethereum is currently the main blockchain ecosystem providing decentralised trust guarantees for applications ranging from finance to e-government. A common criticism of blockchain networks has been their energy consumption and operational costs. The switch from Proof-of-Work (PoW) protocol to Proof-of-Stake (PoS) protocol has significantly reduced this issue, though concerns remain, especially with network expansions via additional layers. The ERC-4337 standard is a recent proposal that facilitates end-user access to Ethereum-backed applications. It introduces a middleware called a bundler, operated as a third-party service, where part of its operational cost is represented by its power consumption. While bundlers have served over 500 million requests in the past two years, fewer than 15 official bundler providers exist, compared to over 100 regular Ethereum access providers. In this paper, we provide a first look at the active power consumption overhead that a bundler would add to an Ethereum access service. Using SmartWatts, a monitoring system leveraging Running Average Power Limit (RAPL) hardware interfaces, we empirically determine correlations between the bundler workload and its active power consumption.
The Execute-Order-Validate (EOV) framework has been used to improve the scalability of blockchains by concurrently executing transactions. However, the EOV framework also poses a critical performance issue. Specifically, when multiple transactions access the same data, only one of them can be committed eventually while the others are aborted due to the strong concurrency control restriction. This inefficiency makes the EOV framework far from practicality since there always exist hotspot variables that can be frequently accessed in real-world scenarios, such as the Fungible Token (FT) and Non-Fungible Token (NFT) online marketplace. In this paper, we propose RapidSnail, a novel EOV framework that enables transactions to execute based on the uncommitted data to reduce the transaction abort rate in such scenarios with hotspot variables. We first propose a new read-write set representation and a concurrency execution schedule algorithm in the execution phase to maintain the concurrent efficiency. Then we propose an effect-based conflict graph construction algorithm in the order phase to handle the conflict transactions based on the new read-write set. Finally, we propose a concurrent commitment schedule algorithm to adopt the new read-write set to validate the transactions concurrently in the validation phase. Our experiment results show that RapidSnail increases the throughput by at least 4× compared to the state-of-the-art EOV framework under high contention workload. More specifically, RapidSnail reduces the abort rate by 50%, and achieves at least 4× speedup in the order phase and 2.94× speedup in the validation phase over the existing EOV frameworks.
Distributed Ledger Technology (DLT) has emerged as a promising solution for constructing decentralized and trustworthy platforms in recent years. Although blockchain, as a form of distributed ledger technology known for its tamper resistance and trustworthiness, seems to be an ideal solution for addressing trust issues, common blockchain systems face limitations due to the ever-growing volume of data. In this paper, we propose a dynamic storage scheme calledEfficiency-awareLow-storageScalability (ELS), which allocates variable data storage for the distributed ledgers. Our approach is designed to provide load balancing and security, allowing dynamic nodes to join or exit the network seamlessly. We utilize graph theory to group storage nodes in the blockchain by determining their network distances. These groups are then mapped into points in a two-dimensional virtual plane, meaning that block storage depends on the coordinates within the virtual plane. To balance storage performance with the evolving block allocation strategy, we develop a Voronoi diagram-based method to achieve near real-time adoptions that meet dynamic allocation requirements in blockchain systems. Experimental evaluations have demonstrated that our approach can reduce storage requirements by approximately 93% at each node, compared to full replication in 10000 block chains.
Directed Acyclic Graph (DAG) based Distributed Ledger Technologies (DLTs) are promising solution for IoT environments, offering scalability and high transaction throughput. Given the resource constraints of IoT Gateways (GWs), which maintain the ledgers, pruning of a ledger is important to prevent its size from increasing beyond the storage capacity of GWs. However, existing methods cannot simultaneously address the scalability and consistency issues for planning and executing the DAG based ledger pruning, consistency preservation, and orphaned transactions. We explore an approach that Storage Nodes (SNs) of the DAG based DLT plan the ledger pruning in an efficient, scalable, and consistent manner, and then GWs execute it. This paper introduces the Consensus based High Consistency Ledger Pruning (CHCLP) Framework, which uses two key techniques: Pruning List Reduction (PLR) and Consensus-based Pruning Mechanism (CPM). PLR aggressively compresses a long list of prunable transactions to the combination of a single transaction called "Adam Point" and the rest encoded as unique bit string paths from the Adam Point. CPM leverages Practical Byzantine Fault Tolerance consensus among SNs to ensure tamper-resistant agreement on the Pruning List (PL) and maintain DAG consistency across GWs. The CHCLP Framework was implemented by extending an existing benchmark DAG based DLT system. The proposed framework reduced the size of a PL by 98%, and the ratio of orphan transactions decreased to 0.5% compared to the benchmark system, which was 10.3%. The CHCLP Framework reduces the storage consumption of GWs in DAG based DLTs to a desirable extent with high consistency, and can drastically improve their scalability and performance.
A digital revolution is taking place in healthcare due to rising patient data volumes, concerns about privacy and security, and the need for interoperable solutions. The demand for trustworthy, scalable, and interoperable technologies has become essential in this fast-growing healthcare industry. Conventional centralised systems regularly encounter challenges meeting these requirements because of problems including storage structure, data privacy, security vulnerabilities, network complexity, and lack of scalability. Additionally, current blockchain implementations frequently face challenges with interoperability, trust management among several healthcare stakeholders, and throughput bottlenecks. To overcome these challenges, this paper introduces a novel framework called LIVER: a Lightweight Infrastructure for Verifiable Electronic Records that integrates Blockchain, InterPlanetary File System (IPFS), Edge computing, and Internet of Medical Things (IoMT) to address these issues. Distributed processing based on edge computing and IPFS, cryptographic methods, blockchain consensus mechanisms, and an immutable ledger allows it to be scalable, secure, interoperable, and boast tamper-proof data integrity. Furthermore, a unique queueing approach has been implemented to improve operational efficiency, which controls patient flow, decreases wait times, maximises resource utilisation, minimises healthcare delays, and enhances the patient experience. Finally, based on the experimental evaluation results, the LIVER framework reduces ledger size, facilitates enhanced data sharing, and improves the healthcare system’s efficiency, scalability, security, and performance. The goal is to provide a framework that can handle the computational and operational limitations of existing healthcare systems while still protecting patient privacy and allowing for scalability.
Carlos Cardoso, Caio Silva, Alan Veloso, Jeffson Sousa · 5 authors
As Distributed Ledger Technologies (DLTs) mature into production-grade systems, a critical gap emerges between protocol-level benchmarking and application-centric performance testing. While specialized tools like Hyperledger Caliper excel at measuring core on-chain metrics, they are less suited for evaluating the end-to-end performance of applications that interact with the DLT through an intermediary API layer. This paper addresses this gap by proposing a three-tier, API-driven framework that enables mature, general-purpose load testing tools, such as Apache JMeter, to realistically assess a Hyperledger Besu network’s performance from an application’s perspective. The core of our solution is a custom API server that provides essential services like atomic nonce management and dynamic load balancing. Our comparative analysis demonstrates that while Caliper may report higher end-to-end throughput under specific conditions, our framework induces a significantly more substantial and evenly distributed load, revealing a more accurate picture of the network’s true processing capacity. Furthermore, our approach captures API-layer latency—a crucial metric for client-perceived responsiveness—which proved to be an order of magnitude lower than the on-chain finality measured by Caliper. This work validates a reusable architectural pattern for testing DLTs within a realistic application stack, bridging the gap between protocol benchmarking and real-world performance engineering.
Vitor Emanuel Batista, Guilherme Koslovski, Maurício A. Pillon, Charles C. Miers · 6 authors
Cloud computing has become the dominant choice for hosting various systems and services, with substantial public cloud service spending growth. This trend has extended to blockchain technology, which offers decentralized solutions for diverse applications. Concurrently, there is an increasing focus on business models incorporating Environmental, Social and Governance (ESG) aspects. One such initiative is Carbono21, a platform generating tokens in response to reforestation actions and the carbon credit market. In this context, this article examines the performance aspects of generating Non-Fungible Tokens (NFTs) in a blockchain environment under stress conditions. The Hyperledger Caliper was the benchmark tool used in experiments conducted to analyze the blockchain’s resilience and stability. Linear regression models showed a strong positive correlation between memory usage and total transactions. These results highlight the need for precise resource sizing and robust monitoring mechanisms to prevent service degradation under high transaction loads.
Fernando Richter Vidal, Naghmeh Ivaki, Nuno Laranjeiro
The performance assessment of blockchain applications holds significant challenges due to their decentralized architecture, immutable smart contracts, distributed ledgers, and operational costs such as gas fees. Existing blockchain benchmarks often either fail to fully capture blockchain-specific behaviors or offer limited configurability and metric reporting. In this paper, we present a new and comprehensive benchmark designed explicitly for blockchain applications, named bBench. Building on established principles from traditional benchmarking and by specializing them in the blockchain context and supported by customized blockchain tools (i.e., Hyperledger Caliper, web3.eth, and node-os-utils), bBench characterizes blockchain application performance in four dimensions: network performance, resource utilization, storage usage, and operational cost. We demonstrate the effectiveness of our benchmark through a case study involving 12 smart contract applications with varying performance demands, some of which hold known vulnerabilities. The results show the benchmark’s ability to quantify performance deviations across different applications, as well as those caused by the activation of specific vulnerabilities.
This paper investigates performance bottlenecks of consortium blockchains under high-throughput and low-latency requirements, focusing on excessive storage burden on full nodes and redundant computation in transaction validation. Based on consortium blockchain, a novel architecture named Server-Side Core Chain (SSC) is proposed. In this architecture, the core functions of blockchain ledger data storage and smart contract execution are delegated from decentralized consensus nodes to a server cluster jointly managed and trusted by consortium members. The consensus node layer is restructured into a lightweight ``Consensus and Audit Network,” dedicated to transaction ordering and state commitment verification. This paper elaborates on the design principles, operational workflow, and security model of the SSC architecture. Theoretical analysis and prototype experiments demonstrate that the architecture significantly enhances the transaction processing capacity of consortium blockchains (experimental results show a throughput improvement of more than 18 times), greatly reduces the entry barriers and operational costs for member nodes (storage overhead reduced by over 99%), and ensures the verifiability of off-chain computations and data privacy through cryptographic commitments and zero-knowledge proofs [1]. The SSC architecture offers a new solution for deploying consortium blockchains in large-scale applications, including finance, supply chain management, and e-government.
Ilya Evdokimov, Stepan Kamentsev, A. V. Alexeev, Kirill Mikheev · 5 authors
This paper surveys the evolution of smart contract virtual machines (VMs), highlighting major designs such as Ethereum Virtual Machine (EVM), Move VM, Solana VM and couple of lesser known VMs. It eventually proposes a Rust implementation of Ton Open Network Virtual Machine (TVM) called Tycho VM. We analyze the theoretical foundations behind TVM’s “everything is a cell” paradigm and message execution lifecycle inside sandboxed VM. We also contextualize the role of virtual machines in the broader blockchain ecosystem by referencing developer adoption metrics and indicate challenges arising from that, namely, inefficiencies of Solidity to Tycho VM compiler which are going to be addressed in the future research.
This paper presents a quantitative model to estimate the sustainability of blockchain networks. Blockchains with three different consensus protocols such as Proof of Work (PoW), Proof of Stake (PoS) and Proof of Hybrid consensus protocols across PoW and PoS(PoH) [12], are considered in this research. Sustainability issues in blockchain network systems due to their energy-depleting mining processes and transactions are hindering the technology from further advancement. The sustainability of concern in blockchain networks is assumed, in this paper, to be an inverse of their energy consumption without loss of generality and intuitiveness. The novelty of the proposed model is that the sustainability is estimated quantitatively in a specific context of blockchain network architectures and stochastic behaviors of the transactions. An extensive variety of variables are employed to build a model that is blockchain (e.g., $\mathrm{PoW}, \mathrm{PoS}$ and PoH)-specific, as three representative benchmark architectures with respect to consensus protocols, and each of those will be quantitatively expressed via the baseline chain model [7], the PoS chain model [9] and the PoH chain model [12], respectively. Extensive numerical simulations will be conducted to demonstrate various design considerations to be taken in specific regard of sustainability versus a few primary design variables as employed in the sustainability model. The proposed sustainability model is expected to establish a sound and quantitative foundation for the design of sustainable blockchain networks.
Raaj Anand Mishra, Preeti Bhaskar, M. Hafijul Islam Khan
Purpose Universities worldwide face significant challenges in maintaining administrative data, including security flaws, delays in verification processes and a lack of confidence among those involved. The purpose of this paper is to design an integrated blockchain-based decentralized application architecture for the University of Technology and Applied Sciences (UTAS) in Oman, aligning with Vision 2040’s sustainability goals. Design/methodology/approach The solution uses a hybrid architecture that combines the benefits of the public blockchain with governance at the consortium level appropriate for educational organizations. The user interface layer has role-based dashboards for various stakeholder groups, ensuring proper access control and user experience improvement. The application layer integrates Web3 using the Next.js framework, allowing for seamless interaction between standard Web interfaces and blockchain capabilities. The smart contract layer is made up of eight specialized contracts that handle various administrative responsibilities, each designed with a modular architecture to provide maintainability and upgradeability. The blockchain layer makes use of Ethereum’s proven infrastructure and proof-of-stake consensus, which is dispersed across UTAS’s 13 campuses to ensure decentralization and fault tolerance. Findings This study broadens the architecture by leveraging well-established blockchain frameworks for credential management to include a wide range of educational administrative tasks such as admissions, certifications, alumni management, library services, on-the-job training, examinations and placements across UTAS’s 13 campuses located in 11 governorates. The suggested system makes use of the Ethereum blockchain platform with smart contracts, as well as the InterPlanetary File System for distributed document storage, to ensure immutability, transparency and cost-effective administrative operations. The architecture consists of eight core smart contracts that regulate various administrative duties, five types of stakeholders and a uniform dashboard system that allows seamless data transmission and verification across campuses. Practical implications Key contributions include a practical implementation framework with phased deployment methods, a complete stakeholder governance model and quantitative benefits showing a reduction in processing times and operational cost savings. The architecture’s modular nature allows it to adapt to changing educational requirements while remaining compatible with new technologies such as artificial intelligence and the Internet of Things. Originality/value This research addresses the present limitations of traditional educational administration systems and establishes a framework for the further deployment of blockchain technology in Oman’s higher education sector.
Yanjing Ren, Jia Zhao, Jingwei Li, Patrick P. C. Lee
Blockchains have revolutionized trust and transparency in distributed systems, yet their heavy reliance on key-value (KV) storage for managing immutable, rapidly growing data leads to performance bottlenecks due to I/O inefficiencies. In this paper, we analyze Ethereum’s storage workload traces, with billions of KV operations, across four dimensions: storage overhead, KV operation distributions, read correlations, and update correlations. Our study reveals 11 key findings and provides suggestions on the design and optimization of blockchain storage.
Blockchain technology promises to revolutionize payment systems, yet high transaction costs and network congestion remain significant barriers. This paper introduces WePay, a novel blockchain payment solution that achieves up to $87 \%$ reduction in transaction costs through an innovative gas optimization framework. Our system implements a proprietary transaction batching algorithm, non-custodial cross-chain execution model, and adaptive fee structure that outperforms existing solutions across key metrics. Benchmarking results demonstrate WePay’s superior performance, processing $\mathbf{1, 2 0 0}$ transactions per minute compared to $300-500$ for traditional methods, while maintaining robust security guarantees. User testing with 50 participants revealed a $92 \%$ satisfaction rate and significantly improved adoption potential compared to current blockchain payment systems.
Vladyslav Nekriach, Sidi Mohamed Beillahi, C. Li, Peilun Li · 7 authors
This paper introduces HEMVM, an innovative heterogeneous blockchain framework that seamlessly integrates diverse virtual machines (VMs), including the Ethereum Virtual Machine (EVM) and the Move Virtual Machine (MoveVM), into a unified system. This integration facilitates interoperability while retaining compatibility with existing Ethereum and Move toolchains by preserving high-level language constructs. HEMVM's unique cross-VM operations allow users to interact with contracts across various VMs using any wallet software, effectively resolving the fragmentation in user experience caused by differing VM designs. Our experimental results demonstrate that HEMVM is both fast and efficient, incurring minimal overhead (less than 4.4 %) for intra-VM transactions and achieving up to 9300 TPS for cross-VM transactions. Our results also show that the cross-VM operations in HEMVM are sufficiently expressive to support complex decentralized finance interactions across multiple VMs. Finally, the parallelized prototype of HEMVM shows performance improvements up to 44.8 % compared to the sequential version of HEMVM under workloads with mixed transaction types.
This study tackles the computational challenges of solving Markov Decision Processes (MDPs) for a restricted class of problems. It is motivated by the Last Revealer Attack (LRA), which undermines fairness in some Proof-of-Stake (PoS) blockchains such as Ethereum (\$400B market capitalization). We introduce pseudo-MDPs (pMDPs) a framework that naturally models such problems and propose two distinct problem reductions to standard MDPs. One problem reduction provides a novel, counter-intuitive perspective, and combining the two problem reductions enables significant improvements in dynamic programming algorithms such as value iteration. In the case of the LRA which size is parameterized by $κ$ (in Ethereum's case $κ$= 325), we reduce the computational complexity from $O(2^κκ^{2^{κ+2}})$ to $O(κ^4)$ (per iteration). This solution also provide the usual benefits from Dynamic Programming solutions: exponentially fast convergence toward the optimal solution is guaranteed. The dual perspective also simplifies policy extraction, making the approach well-suited for resource-constrained agents who can operate with very limited memory and computation once the problem has been solved. Furthermore, we generalize those results to a broader class of MDPs, enhancing their applicability. The framework is validated through two case studies: a fictional card game and the LRA on the Ethereum random seed consensus protocol. These applications demonstrate the framework's ability to solve large-scale problems effectively while offering actionable insights into optimal strategies. This work advances the study of MDPs and contributes to understanding security vulnerabilities in blockchain systems.
The problem addressed in this study is the lack of a proper conceptualization of the Distributed Ledger Technology-based Central Bank Digital Currency technical language that guides central banks and their stakeholders in the platforms design and implementation.This research aims to improve the DLT-based CBDC knowledge, proposing a human-centered reference model.We use Design Science Research methodology combined with other research methods.The literature has not provided a reference model that can be used to improve the design of the CBDC system to meet regulatory requirements.This study fills the gap in the literature by presenting a human-centered reference model for DLT-based CBDC that serves as a decision-aid tool to study citizens' needs and behaviors, to design user experience, to improve alignment between cultural values and policy roles, and to facilitate communication between experts and stakeholders on currency digitalization process.
Moderne Blockchains verarbeiten mittlerweile Zehntausende Transaktionen pro Sekunde. Mit steigendem Durchsatz wachsen jedoch auch die Anforderungen für die Verifikation von Blockchains. Zentralisierte Node-as-a-Service (NaaS)-Anbieter (z.B. Infura oder Alchemy) bieten zwar praktische APIs, schaffen jedoch zusätzliche Vertrauensabhängigkeiten und bergen Risiken in Bezug auf Datenschutz und Zensurfreiheit. Ein selbst betriebener Full Node ermöglicht Datenzugang ohne zusätzliche Vertrauensannahmen, ist für die meisten Nutzerinnen und Nutzer jedoch aufgrund des hohen Ressourcenbedarfs kaum praktikabel. Im Gegensatz dazu arbeiten Light Clients deutlich ressourcenschonender, können dafür den vollständigen Anwendungszustand nicht rekonstruieren. Ein neuer Ansatz, der als Sparse Client (bzw. Partially Stateless Client) bekannt ist, ermöglicht dagegen die verifizierbare Überwachung eines Teilzustands der Blockchain, indem ausschließlich jene Transaktionen heruntergeladen, ausgeführt und gespeichert werden, die diesen Teilzustand lesen oder verändern. Bisher fehlt eine fundierte wissenschaftliche Aufarbeitung: Die einzige verfügbare Arbeit zu diesem Thema weist deutliche Limitierungen auf und wurde weder implementiert noch umfassend evaluiert. In dieser Arbeit präsentieren wir zwei Sparse-Client-Protokolle für EVM-kompatible Blockchains: Sparseth für zustandsbasierte Synchronisation und Eventeth für ereignis-basierte Synchronisation. Beide Protokolle ermöglichen es Nutzerinnen und Nutzern, überprüfbare Teilmengen der globalen Transaktions- oder Ereignissequenz und des damit verbundenen Zustands zu verwalten, ohne dass zusätzlicher Validator-Aufwand erforderlich ist. Sparseth nutzt einen Interaktionszähler, um sicherzustellen, dass keine relevanten Transaktionen ausgelassen werden, während Eventeth eine kryptographische Hash-Kette einsetzt, um die Integrität und Vollständigkeit der Ereignisse zu gewährleisten. Im Gegensatz zu bestehenden Ansätzen arbeiten beide Protokolle vollständig auf der Ausführungsschicht und sind mit EVM-basierten Blockchains kompatibel. Unsere formale Analyse zeigt, dass beide Protokolle im angenommenen Widersacher-Modell Sicherheit, Liveness und spärliche Gültigkeit garantieren. Unsere Implementierung in Go demonstriert die praktische Umsetzbarkeit: Event Nodes senken den Bandbreitenbedarf um über 95%, Sparse Nodes reduzieren die auszuführenden Transaktionen um 92% gegenüber Full Nodes. Die Gas-Kosten steigen um 4-16% für typische dApp-Transaktionen, ein Mehraufwand, der sich durch L2-Lösungen und ökonomische Anreize weiter mindern lässt.