Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.33538

Tokenised Sukuk: A Verifiable Architecture for Asset Evidence and Programmable Shariah Compliance

Rischan Mafrur·Khadijah·Gun Gun Febrianza
View original source ↗Read source document ↗Export metadata ↓

Abstract

Security-token standards such as ERC-3643 decide who may hold a token, not what stands behind it. For a sukuk this gap matters: whether a certificate may trade at a negotiated price depends on what its portfolio contains, and a token that checks only investor identity keeps trading after every non-debt asset has been sold. We ask whether this tradability condition can be enforced on-chain, and at what cost. We encode the tradability conditions of the 2023 resolution of the Shariah Advisory Council of the Securities Commission Malaysia on Sukuk Wakalah bi al-Istithmar as issuance and transfer policies that read EIP-712 claims, signed by separate institutional roles, about each asset's rights, valuation, encumbrance and Shariah classification and about the allocation of proceeds. Across 26 scenarios that we constructed on a synthetic instrument, an identity-only baseline wrongly allowed 13 operations that the encoded policy denies, and asset evidence without the Shariah rule still allowed 6. The full policy matched every expected outcome and added 35,834 gas (71.0%) per transfer, independent of portfolio size. Our evaluation also exposes a trade-off that the constructed scenarios had missed. Checking the continuing condition through a single nominated asset keeps the cost of a transfer constant but can block trades the ruling allows, and a bounded fallback scan narrows this gap at about 12,050 gas per scanned asset. Our results indicate that Shariah tradability conditions can be enforced on-chain against attributable asset evidence, and that the way a ruling is encoded shapes which lawful trades a token permits. GitHub repo: https://github.com/rischanlab/tokenized_sukuk

Explore related subjects

cs.CEq-fin.CP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rischan Mafrur, Khadijah, Gun Gun Febrianza. 2026-10-24. Tokenised Sukuk: A Verifiable Architecture for Asset Evidence and Programmable Shariah Compliance. https://arxiv.org/abs/2610.33538

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

KEEP EXPLORING

Related papers

arXiv2026

Refined Thompson Learning for Adaptive Bandits: Power-Efficient Flexibility Scheduling Across Data Centers

The rapid growth of large-scale AI workloads in data centers has placed increasing pressure on power grids in recent years. Since power systems must continuously balance supply and demand, there is growing interest in leveraging data-center workload flexibility as a grid service. We propose a contextual restless multi-armed bandit (CRMAB) framework in which a grid operator requests load reductions without observing internal job-scheduling decisions. Under an index-ability guarantee, each data center or physical machine is modeled as a Markov decision process (MDP) over a cyclic virtual-machine (VM) job queue, with unknown rewards and transition dynamics that are learned online using Thompson sampling and Whittle-index policies. To improve learning under sparse and noisy observations, the framework augments an adaptive Thompson--Whittle (TW) policy with domain-informed transition priors and gated prior mixing. In baseline experiments, the best refined adaptive variant achieves 91.4\% of the oracle reward after 100 rounds and 96.8\% after 1,000 rounds. Across a 16-setting stress test spanning different state-space sizes and levels of contextual feature noise, the best refined variant consistently outperforms the original TW policy with high confidence while remaining competitive with EXP4. A graph-based prior further incorporates data-center hardware constraints, including operating frequency and computing-resource limits. Overall, our results demonstrate the economic potential of data-center flexibility as a grid service and highlight the importance of high-quality, open-source AI workload traces for developing and evaluating such services.

cs.CE↗
arXiv2026

A Topology-Aware Quantum-Classical Framework for Multi-Target Active Debris Removal using Gaussian Boson Sampling

The continued growth of orbital debris threatens the safety and sustainability of near-Earth space, making Active Debris Removal (ADR) an important mitigation strategy. Selecting $k$ targets from $N$ candidates yields a combinatorial search space of size $\binom{N}{k}$, making joint target selection and mission sequencing computationally demanding. We present a topology-aware quantum-classical framework integrating orbital mechanics, weighted orbital-transfer graphs, Gaussian Boson Sampling (GBS), and multi-objective evolutionary optimization. Seven target-prioritization strategies represent physical consequence, orbital persistence, conjunction risk, network centrality, community structure, inferred source families, and random selection. GBS generates candidate target subsets from the weighted graph, which are then evaluated using PyGMO-based evolutionary optimization to identify servicing sequences that jointly minimize total velocity increment ($Δv$) and mission duration, accounting for modeled timing, propulsion, and mass feasibility. We evaluate the framework across three benchmark environments, SOCRATES Minefield, Collision Cloud, and Random, with candidate-pool sizes $N\in\{15,18,22,25\}$ and target cardinalities $k\in\{3,5\}$. The experiments characterize how benchmark topology, prioritization strategy, and problem scale relate to sampling behavior and downstream mission performance. By separating candidate-subset generation from detailed trajectory optimization, the framework offers a topology-aware approach to focusing computational effort on a limited set of candidate ADR missions.

cs.CE↗
arXiv2026

Faster Polyhedral Intersections in 3D

The operation of intersecting two polyhedra, which can be reduced to clipping one polyhedron with a series of planes formed from another polyhedron, is central to intersection based mesh interpolation and material interface reconstruction. R3D is a robust library for such operation which implements the algorithm of Sugihara. In this paper, we present J3D, a new implementation of the clipping algorithm of Sugihara that provides substantial performance improvements over R3D.

cs.CE↗