论文标题

无许可系统的资源燃烧

Resource Burning for Permissionless Systems

论文作者

Gupta, Diksha, Saia, Jared, Young, Maxwell

论文摘要

工作证明的难题和验证码消耗大量的能量和时间。这些技术是资源燃烧的示例:可验证的资源消耗仅以传达信息。 这些费用可以消除吗?自从资源燃烧的股票与“耗资耗资”和“昂贵的信号传导”相似,这似乎不太可能,这是游戏理论,生物学和经济学的基础。这些费用可以降低吗?是的,研究表明,我们可以显着降低许多不同环境中资源燃烧的渐近成本。 在本文中,我们调查了有关资源燃烧的文献;根据对工具可能如何发展的预测来占据位置;并提出了针对理论分布式计算研究社区的几个开放问题。

Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time. These techniques are examples of resource burning: verifiable consumption of resources solely to convey information. Can these costs be eliminated? It seems unlikely since resource burning shares similarities with "money burning" and "costly signaling", which are foundational to game theory, biology, and economics. Can these costs be reduced? Yes, research shows we can significantly lower the asymptotic costs of resource burning in many different settings. In this paper, we survey the literature on resource burning; take positions based on predictions of how the tool is likely to evolve; and propose several open problems targeted at the theoretical distributed-computing research community.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源