Zero-knowledge proof generation imposes stringent timing and reliability constraints on blockchain systems. For ZK-rollups, delayed proofs cause finality lag and economic loss; for Ethereum's emerging L1 zkEVM, proofs must complete within the 12-second slot window to enable stateless validation. The Ethereum Foundation's Ethproofs initiative coordinates multiple independent zkVMs across proving clusters to achieve real-time block proving, yet no principled orchestration framework addresses the joint challenges of (i) strict head-of-chain ordering, (ii) sub-slot latency bounds, (iii) fault-tolerant task reassignment, and (iv) prover-agnostic workflow composition. We present push0, a cloud-native proof orchestration system that decouples prover binaries from scheduling infrastructure. push0 employs an event-driven dispatcher--collector architecture over persistent priority queues, enforcing block-sequential proving while exploiting intra-block parallelism. We formalize requirements drawn from production ZK-rollup operations and the Ethereum real-time proving specification, then demonstrate via production Kubernetes cluster experiments that push0 achieves 5 ms median orchestration overhead with 99--100% scaling efficiency at 32 dispatchers for realistic workloads--overhead negligible (less than 0.1%) relative to typical proof computation times of 7+ seconds. Controlled Docker experiments validate these results, showing comparable performance (3--10 ms P50) when network variance is eliminated. Production deployment on the Zircuit zkrollup (14+ million mainnet blocks since March 2025) provides ecological validity for these controlled experiments. Our design enables seamless integration of heterogeneous zkVMs, supports automatic task recovery via message persistence, and provides the scheduling primitives necessary for both centralized rollup operators and decentralized multi-prover networks.
Blockchain technology has revolutionized real-time applications with its decentralized, secure, and immutable framework, wherein the consensus mechanisms play a principal role in deciding transaction speed, security, and scalability. Traditional consensus mechanisms like Proof of Work (PoW) were affected by latency and energy inefficiency, while modern alternatives such as Proof of Stake (PoS), Practical Byzantine FaultTolerance (PBFT), and Delegated Proof-of-Stake (DPoS) realize faster and scalable solutions to real-time applications for Finance, Supply Chain, Healthcare, and IoT. This survey conducts a systematic analysis of the various consensus algorithms, including PoW, PoS, PBFT, and some upcoming models like Proof of History (PoH), in regard to throughput, latency, and security and finds that PoS-based systems and DAG (Directed Acyclic Graph) systems such as Solana and Ethereum 2.0 excel over PoW for low-latency applications with thousands of transactions per second (TPS). Despite these improvements, present-day blockchain technologies are encumbered with challenges like scalability bottlenecks, interoperability challenges, and regulatory restrictions, which prompt the search for future solutions such as hybrid consensus methods (PoS + sharding), Layer-2 scaling approaches (including rollups and sidechains), and AI-based optimizations that could benefit real-time operations of blockchains without compromising security and decentralization.
Suggested Citation: Jo, Gwangsik. (2026). DLT-DSA: Design and Verification of a Local Autonomous Integrity Verification Model Using Adaptive Verification Intensity. Zenodo. AbstractIn some distributed ledger systems, transaction verification requires consensus procedures and network synchronization, and previous studies have reported that verification overhead tends to scale with increasing request frequency. This paper proposes a lightweight architecture, DLT-DSA (Distributed Ledger Technology – Decentralized Sovereign Access), designed to reduce dependence on global consensus and to pre-determine request integrity at the node level. The model adopts a multi-stage local verification structure using a context-aware mechanism: normal requests undergo lightweight verification based on ROA (Reduced Overhead Access), while anomalous conditions trigger autonomous integrity verification based on SHV (Self-Hash Verification). Proof-of-Concept (PoC) experiments show that the execution time of the verification logic remains within a stable range independent of variations in network round-trip time (RTT) and exhibits deterministic resource utilization under varying load conditions. These observations suggest that partial relocation of verification procedures to local processing can serve as a viable design alternative in real-time response environments. For more information about the author's professional background and ongoing projects, please visit: LinkedIn: https://www.linkedin.com/in/gwangsik-jo-3295a43b5 ORCID: https://orcid.org/0009-0008-5702-8940
This paper presents the implementation oriented development of an interactive web platform designed to bring transparency and trust to charitable giving through the use of blockchain technology. This DApp integrates both Web2 and Web3 components: Here organizations create verified charity campaigns so that donors contribute directly through Meta-Mask a cryptocurrency wallet, with all transactions immutably recorded on the blockchain for public auditability. The backend (Web2) manages user data, campaign verification, and document storage, enforcing legitimacy through decentralized storage (IPFS). Also with the use of web2 has helped to create a more user friendly and attractive user interface layouts. Etherium Smart contracts are used to handle and release donations based on predefined conditions. A Merkle Tree algorithm is implemented to provide cryptographic proof for inclusion of donations in charities. This platform solves common challenges of traditional charity systems, such as mismanagement, high intermediary fees, and mainly donor mistrust, by offering a secure, decentralized, and automated donation ecosystem.
Blockchain technology is a distributed ledger system providing secure, transparent, decentralized cryptocurrency transactions. Its underlying structure includes wallets and the Unspent Transaction Output (UTXO), which facilitates transactions and maintains transaction integrity. A blockchain wallet is a software program that stores and manages cryptocurrencies, allowing users to send and receive digital currency and monitor their balance. The UTXO set tracks unspent outputs, particularly in the Bitcoin network, ensuring accurate and secure accounting of available balances. This paper examines how well a hybrid data structure performs when processing wallet values in a UTXO set. The hybrid data structure stores the wallet’s addresses in a hash table and the UTXO in a minimum heap tree rather than a list. At first, we assume that the values in the list should always be sorted and appear in ascending order. Then, we employ a list with unsorted values. The wallet addresses are invariably assigned to a hash table. The “instruction count” approach counts the number of statements that can be executed or what we refer to as a “single operation” to measure performance.
DELTA is a project funded by the Valencian Institute for Business Competitiveness (IVACE) and the European Union through the European Regional Development Fund (FEDER). DELTA project is aimed at bringing companies closer to the use of different disruptive technologies such as Blockchain / Distributed Ledger Technologies (DLT). To achieve its goal, DELTA will provide: A software tool for automating the deployment of DLT networks, regardless of the number of required nodes, or the process of joining an existing network. A modular mechanism that allows the synchronization of DLTs with databases. The goal of this mechanism is to ease and improve the way data is retrieved from a DLT ledger. An accountability tool for shared environments for the exchange of services that brings in some of the most important characteristics of blockchain/DLTs: facilitating auditing and accountability by each participant, use of tokens, etc.
ELTA is a project funded by the Valencian Institute for Business Competitiveness (IVACE) and the European Union through the European Regional Development Fund (FEDER). DELTA project is aimed at bringing companies closer to the use of different disruptive technologies such as Blockchain / Distributed Ledger Technologies (DLT). To achieve its goal, DELTA will provide: A software tool for automating the deployment of DLT networks, regardless of the number of required nodes, or the process of joining an existing network. A modular mechanism that allows the synchronization of DLTs with databases. The goal of this mechanism is to ease and improve the way data is retrieved from a DLT ledger. An accountability tool for shared environments for the exchange of services that brings in some of the most important characteristics of blockchain/DLTs: facilitating auditing and accountability by each participant, use of tokens, etc.
In primary-backup replication, consensus latency is bounded by the time for backup nodes to replay (re-execute) transactions proposed by the primary. In this work, we present Ira, a framework to accelerate backup replay by transmitting compact \emph{hints} alongside transaction batches. Our key insight is that the primary, having already executed transactions, possesses knowledge of future access patterns which is exactly the information needed for optimal replay. We use Ethereum for our case study and present a concrete protocol, Ira-L, within our framework to improve cache management of Ethereum block execution. The primaries implementing Ira-L provide hints that consist of the working set of keys used in an Ethereum block and one byte of metadata per key indicating the table to read from, and backups use these hints for efficient block replay. We evaluated Ira-L against the state-of-the-art Ethereum client reth over two weeks of Ethereum mainnet activity ($100,800$ blocks containing over $24$ million transactions). Our hints are compact, adding a median of $47$ KB compressed per block ($\sim5\%$ of block payload). We observe that the sequential hint generation and block execution imposes a $28.6\%$ wall-time overhead on the primary, though the direct cost from hints is $10.9\%$ of execution time; all of which can be pipelined and parallelized in production deployments. On the backup side, we observe that Ira-L achieves a median per-block speedup of $25\times$ over baseline reth. With $16$ prefetch threads, aggregate replay time drops from $6.5$ hours to $16$ minutes ($23.6\times$ wall-time speedup).
As blockchain evolves toward complex Decentralized Finance (DeFi) applications, traditional serial execution becomes a primary bottleneck. Sharding offers a promising Layer-1 scaling solution but trades off cross-shard atomicity and execution latency. Existing solutions enforcing strong consistency via global sequencing or heavy two-phase commit (2PC) often suffer from high latency and resource redundancy. We propose HD-OCC, a high-performance framework combining deterministic execution with assertion-based Optimistic Concurrency Control (OCC). HD-OCC utilizes Proof of History$(\text{PoH})$for a dual-layer sequencing architecture, establishing a global partial order that decouples local processing from global consensus. Our assertion-based OCC enables the coordinator to speculatively execute transactions while parallelizing resource locking to mask network latency. Additionally, a deterministic scheduling engine implicitly constructs a deadlock-free dependency graph. Experimental results demonstrate that HD-OCC achieves linear throughput scalability and significantly lower end-to-end latency compared to monolithic architectures and deterministic systems like Calvin.
AbstractContemporary blockchain architectures face a critical impasse defined herein as the "Tetra-Lemma"—a four-dimensional optimization problem comprising decentralization, security, scalability, and thermodynamic sustainability. Proof-of-Work networks confront diminishing security budgets due to the exhaustion of block subsidies, while Proof-of-Stake systems risk validator centralization. This paper establishes a Unified Monetary-Supply Framework that resolves these structural conflicts by synthesizing the deterministic "Customized Halving" schedule with the probabilistic regeneration logic of the Proof of Rinne (PoR). We demonstrate that by enforcing a "Thermodynamic Statute of Limitations" on dormant assets, the protocol functions as a Non-Equilibrium Thermodynamic Engine. This architecture transforms entropic asset attrition—traditionally viewed as systemic loss—into a regenerative security budget. Using Rincoin as a case study, the model proves that a high-frequency blockchain can maintain a deflationary supply curve while anchoring the effective circulation at a permanent target equilibrium, offering a rigorous blueprint for a closed-loop, regenerative digital economy over a secular horizon. Key Quantitative Findings Asymptotic Convergence: While the effective circulating supply may experience a temporary peak (approx. 27 million RIN), the Dual-Layer Temporal Architecture ensures stabilization below the 21 million threshold (specifically converging to 20.88 million RIN). Perpetual Stability: Beyond the initial mining and transition phases (spanning 443–703 years), the PoR mechanism ensures the indefinite maintenance of the effective circulating supply. This transcends the finite lifecycle of traditional PoW assets by establishing a permanent, self-sustaining regenerative cycle. Thermodynamic Equilibrium: Mathematical verification of the "Golden Ratio" between Reserve, Unrecovered Loss, and Actual Circulation (approx. 77 : 70 : 21). Publication StatusThis manuscript (v1.6.1) serves as the foundational theoretical framework for the Rincoin protocol. Future iterations will formalize the consensus mechanisms required to govern these algorithmic parameters. Integrity & Provenance ArchitectureThe scientific integrity and existence of this document are secured by a Triple-Verification Layer: 1. Academic Provenance: Indexed via Zenodo (DOI: 10.5281/zenodo.17141922). 2. Thermodynamic Timestamping: Anchored to the Bitcoin blockchain via OpenTimestamps. 3. Identity Assurance: Digitally signed by the author via a third-party certification authority (GMO Sign). Note: Verification data and the "Certificate of Authenticity" are available in the supplementary files. CorrespondencePrimary Author: Michiru Tokino (also known as Aevust in the decentralized infrastructure community). Academic Inquiries: edu@aevust.org Community Governance: @aevustus (Discord) / @aevust (X/Telegram) Keywords: Rincoin, Proof of Rinne (PoR), non-equilibrium thermodynamic engine, phase transition of value, dual-layer architecture, customized halving, thermodynamic statute of limitations, regenerative crypto-economics, blockchain tetra-lemma.
Contemporary enterprises encounter substantial difficulties managing information dispersed across varied cloud infrastructures, geographically separated facilities, and specialized application environments. Traditional centralized frameworks, including consolidated data repositories and analytical warehouses, demonstrate limited capacity to deliver the required velocity, accuracy, and contextual intelligence necessary for sustained digital progression. Multi-Cloud Data Mesh constitutes a transformative architectural approach, advocating decentralized, domain-centric methodologies that systematically address intricate governance complexities and interoperability obstacles at the organizational scale. This framework establishes operational foundations through four fundamental tenets: Domain-Oriented Ownership, Data as a Product, Self-Serve Platform, and Federated Computational Governance. These architectural pillars collectively resolve decentralization imperatives, scalability prerequisites, interoperability complications, and sovereignty considerations inherent in modern enterprise ecosystems. Through ownership distribution to specialized domains, product-oriented information treatment, self-service platform provisioning, and federated governance implementation, organizations attain necessary scalability, operational flexibility, and contextual precision for continuous innovation across sophisticated multi-cloud landscapes
Blockchain technology offers decentralized and secure transaction processing but suffers from critical limitations in scalability, energy efficiency, and latency, hindering its adoption in real-time high-throughput applications. This study proposes a novel Adaptive Global Best–Worst Particle Swarm Optimization (AGBWPSO) algorithm integrated with dynamic sharding to address these challenges effectively. Unlike traditional GBWPSO, the proposed AGBWPSO employs a dual-extremum influence mechanism that combines both global best and worst positions, along with adaptive nonlinear parameter adjustment strategies for the inertia weight, cognitive, and social coefficients. This enhances exploration–exploitation balance, prevents premature convergence, and ensures efficient shard reallocation under dynamic transaction loads. The integration with dynamic sharding enables parallel transaction processing across optimally configured shards, significantly improving blockchain performance metrics. Extensive simulations conducted on Ethereum, Bitcoin, Hyperledger Fabric, financial, and IoT transaction datasets demonstrate that the proposed AGBWPSO achieves up to 5.88% improvement in transaction throughput (TPS), 14.3% reduction in latency, and 20% reduction in energy consumption per transaction compared to existing optimization methods. These results establish AGBWPSO as a robust and scalable solution for enhancing the operational efficiency and sustainability of blockchain networks in real-world applications.
Nur Haliza Abdul Wahab, Juniardi Nur Fadila, Nur Faszha Razali, Keng Yinn Wong
High transaction costs remain a major barrier to the scalability of Ethereum-based decentralized applications (DApps), particularly when smart contracts are computationally inefficient. Although the Solidity compiler optimizer can reduce bytecode size and improve some low-level patterns, it does not fully address structural inefficiencies in storage layout and state mutation. This study introduces controlled empirical research on the topic of manual smart contract refactoring approaches with the aim of quantifying their impact on gas usage and execution cost in the Ethereum Virtual Machine (EVM). The Remix Integrated Development Environment (IDE) and a synchronized Go-Ethereum (Geth) node (version 1.13.5) were configured to create a controlled experimental environment. This environment was connected to the Sepolia Testnet to approximate conditions similar to the Ethereum Mainnet. The role of high-cost storage operations such as SSTORE was analyzed using opcode-level transaction traces, which were collected using debug_traceTransaction. The proposed refactoring plan implies the alignment of storage slots by systematically packing the variables and data location optimization (calldata and memory) to minimize unnecessary memory allocation. The experiments show gas reductions of up to 40.68% for storage-intensive functions, with an average reduction of 28.5% across all evaluated test cases. Moreover, the findings at the opcode level have shown that it is possible to reduce the costs of unnecessary storage writes without impacting the correct functional performance of the execution. Overall, the findings show that storage-aware manual refactoring is a viable strategy for improving runtime efficiency and reducing the execution cost of Layer-1 smart contracts.
The integration of Internet of Things (IoT) infrastructures with Distributed Ledger Technologies (DLT) remains challenging due to the reliance on complex, tightly coupled back-end systems or centralized oracle services that h... | Find, read and cite all the research you need on Tech Science Press