This work formalizes the structure and protocols underlying recent distributed systems leveraging block DAGs, which are essentially encoding Lamport's happened-before relations between blocks, as their core network primitives. We then present an embedding of any deterministic Byzantine fault tolerant protocol $\mathcal{P}$ to employ a block DAG for interpreting interactions between servers. Our main theorem proves that this embedding maintains all safety and liveness properties of $\mathcal{P}$. Technically, our theorem is based on the insight that a block DAG merely acts as an efficient reliable point-to-point channel between instances of P while also using $\mathcal{P}$ for efficient message compression.

中文翻译：

---

在块DAG中嵌入确定性BFT协议

这项工作使利用块DAG的最新分布式系统的结构和协议形式化，这些DAG本质上将Lamport发生在块之间的关系编码为它们的核心网络原语。然后，我们提出任何确定性拜占庭容错协议$ \ mathcal {P} $的嵌入，以采用块DAG来解释服务器之间的交互。我们的主要定理证明，这种嵌入保留了$ \ mathcal {P} $的所有安全性和活动性。从技术上讲，我们的定理基于以下见解：块DAG仅充当P实例之间的有效可靠点对点通道，同时还使用$ \ mathcal {P} $进行有效的消息压缩。