Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2107.00059

A Fair Method for Distributing Collective Assets in the Stellar Blockchain Financial Network

Mohammad Javad Shayegan·Kiarash Shamsi
View original source ↗Read source document ↗Export metadata ↓

Abstract

The financial industry is a pioneer in Blockchain technology. One of the most popular platforms in Token-based banking is the flexible Stellar platform. This platform is open-source, and today, its wide range of features makes it possible for many countries and companies to use it in cryptocurrency and Token-based modern banking. This network charges a fee for each transaction. As well, a percentage of the net amount is generated as the inflation rate of the network due to the increased number of tokens. These fees and inflationary amounts are aggregated into a general account and ultimately distributed among members of the network on a collective vote basis. In this mechanism, network users select an account as the destination for which they wish to transfer assets using their user interface, which is generally a wallet. This account could be the account of charities that need this help. It is then determined the target distribution network based on the voting results of all members. One of the challenges in this network is the purposeful and fair distribution of these funds between accounts. In this paper, the first step is a complete infrastructure of a Stellar financial network that will consist of three network-based segments of the core network, off-chain server, and wallet interface. In the second step, a context-aware recommendation system will be explored and implemented as a solution for the purposeful management of payroll account selection. The results of this study concerning the importance of the purposeful division of collective assets and showing a context-aware recommendation system as a solution to improve the process of stellar users' participation in the voting process by effectively helping them in choosing an eligible destination

Explore related subjects

cs.DCcs.NI

Keep this discovery

BibTeXRIS

Mohammad Javad Shayegan, Kiarash Shamsi. 2021-06-30. A Fair Method for Distributing Collective Assets in the Stellar Blockchain Financial Network. https://arxiv.org/abs/2107.00059

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↗