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 的分布式系统的结构和协议, 这些系统基本上是将Lamport 在区块之间的关系之前发生的事情编码为核心网络原始。 然后我们将任何确定性的Byzantine断层容忍协议嵌入其中 $\ mathcal{P}$ 用于使用区块 DAG来解释服务器之间的相互作用。 我们的主要理论证明, 嵌入这些系统能维持所有安全和活性特性$\ mathcal{P} $ 。 技术上, 我们的理论依据的洞察力是, 区块 DAG 只能作为P 实例之间一个有效的可靠点对点通道, 同时使用 $\ mathcal{P} $ 来有效压缩信息 。