The last decade has seen a variety of Asset-Transfer systems designed for decentralized environments. To address the problem of double-spending, these systems inherently make strong model assumptions and spend a lot of resources. In this paper, we take a non-orthodox approach to the double-spending problem that might suit better realistic environments in which these systems are to be deployed. We consider the decentralized trust setting, where each user may independently choose who to trust by forming its local quorums. In this setting, we define $k$-Spending Asset Transfer, a relaxed version of asset transfer which bounds the number of times the same asset can be spent. We establish a precise relationship between the decentralized trust assumptions and $k$, the optimal spending number of the system.

翻译：在过去的十年中,为分散环境设计了各种各样的资产转让系统。为了解决双重支出问题,这些系统必然会做出强有力的模型假设并花费大量资源。在本文中,我们对双重支出问题采取非正统做法,可能适合这些系统部署的更现实的环境。我们考虑分散化的信任环境,在这个环境中,每个用户都可以独立地选择通过形成其当地法定人数来信任谁。在这个环境中,我们定义了“双重支出资产转让”这一宽松的资产转移版本,它约束了相同资产可以花费的倍数。我们在分散化的信任假设和系统的最佳支出数字之间建立起一种精确的关系。