• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2019 IEEE International Conference on Blockchain and Cryptocurrency >Distributed Ledger Witness Selection in Bounded Width Directed Acyclic Graphs
【24h】

Distributed Ledger Witness Selection in Bounded Width Directed Acyclic Graphs

机译：有界宽度有向无环图中的分布式分类帐见证选择

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This work explores a new low-latency distributed ledger structure based on bounded width directed acyclic graphs (DAGs). In this design, each user has their own blockchain traceable back to a common root. These individual chains mutually witness each other to confirm transactions and form a global partially ordered set of events. The number of witness hashes required to establish new blocks is defined as the “DAG width”. This width has an upper bound which of the total number of users in the system, though the actual number of witnesses required is usually far less. In this paper we mathematically model the expected DAG width using analytical techniques from the near miss birthday problem and simulate expected widths for expected network latency and user activity.
机译：这项工作探索了一种新的基于有界宽度有向无环图（DAG）的低延迟分布式分类帐结构。在这种设计中，每个用户都有自己的可追溯至公共根的区块链。这些个体链相互见证，以确认交易并形成全局的部分排序的事件集。建立新块所需的见证散列数定义为“ DAG宽度”。该宽度有一个上限，即系统中用户总数的上限，尽管所需的见证人的实际数量通常要少得多。在本文中，我们使用生日临近差错问题的分析技术对DAG预期的宽度进行数学建模，并针对预期的网络延迟和用户活动模拟预期的宽度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号