Blockchain systems often incur high inclusion latency due to validation and finality pipelines, limiting the performance of time-sensitive applications. We present Early Admission (EA), an overlay mechanism that reduces time-to-inclusion by allowing blocks from high-reputation proposers to become provisionally ledger-visible after partial validation. EA uses smart markers to record the provisional status and to support secure, auditable updates once the full validation is complete, and the final commitment remains governed by the underlying consensus. In an event-driven simulator spanning three high-throughput archetypes (Hedera-like, Redbelly-like, and Fabric-style), we find that EA can reduce mean time-to-inclusion by up to 65% under consistent resource assumptions, saturated demand, and bounded in-flight pipeline depth. To show that EA is robust against collusion attacks, we model adversarial incentives as a two-player game and show that collusion becomes economically unattractive when the EA-stage detection rate of early-admitted malicious blocks exceeds approximately 94%, which provides guidance for configuring EA thresholds and penalties.
Matthew Sharp, Laurent Njilla, Chin-Tser Huang· International Conference on...· 0 citations
Priority scheduling techniques aim to schedule tasks with higher priority and tighter deadlines to be executed before other tasks. However, traditional blockchain systems do not work well with priority scheduling due to issues regarding consensus mechanisms, throughput, and scalability. In this work, we propose three transaction scheduling schemes which employ a fee-based model to differentiate priority levels of transactions and select transactions for validation and inclusion based on criteria other than the order of arrival. The Priority-Based Scheduling scheme focuses on the priority level of individual transactions, the Contract-Based Scheduling scheme emphasizes the satisfaction of more customer contracts, whereas the Latency-Based Scheduling scheme prioritizes transactions with closer deadlines when bursts of transactions overwhelm the blockchain network. We implement prototypes of our transaction scheduling schemes in a private Algorand-inspired simulation and evaluate their performance by testing them under scenarios representing different transaction distribution ratios. The results show that the three transaction scheduling schemes outperform the baseline in which no scheduling is applied, and each scheme performs best in the transaction distribution scenario it is designed to handle.
Matthew Sharp, Chin-Tser Huang, Soamar Homsi· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
