Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.05971

Smart Red Belly Blockchain: Enhanced Transaction Management for Decentralized Applications

Deepal Tennakoon·Vincent Gramoli
View original source ↗Read source document ↗Export metadata ↓

Abstract

Decentralized Applications (DApps) have seen widespread use in the recent past driving the world towards a new decentralized version of the web known as Web3.0. DApp-supported blockchains like Ethereum have largely been responsible for this drive supporting the largest eco-system of DApps. Although the low performance provided by Ethereum has been a major impediment to realizing a decentralized web, several high-performance blockchains have been introduced recently to bridge this gap. Most of these blockchains rely on consensus optimizations. Only a few enhance other parts of the blockchain protocol that involves transaction management: the validation of transactions, broadcast of transactions, encapsulation and dissemination of blocks with transactions, re-validation and execution of transactions in blocks, storage of blocks, and confirmation of transaction commits to senders upon request. In this paper, we enhance transaction management by introducing a novel transaction validation reduction and a per sub-block processing to optimize the block storage. We empirically show the performance improvements gained by our enhanced transaction management in the Smart Red Belly Blockchain (SRBB) VM we develop. Finally, we integrate our SRBB VM to an already optimized consensus from a known blockchain to develop the Smart Red Belly Blockchain. Our results show that SRBB achieves a peak throughput of 4000 TPS and an average throughput of 2000 TPS on 200 nodes spread across 5 continents. SRBB outperforms 6 other blockchains when running the exchange DApp featuring a real workload trace taken from Nasdaq.

Explore related subjects

cs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Deepal Tennakoon, Vincent Gramoli. 2022-07-13. Smart Red Belly Blockchain: Enhanced Transaction Management for Decentralized Applications. https://arxiv.org/abs/2207.05971

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗
arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗
arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗