Proof-of-Work~(PoW) based blockchains typically allocate only a tiny fraction (e.g., less than 1% for Ethereum) of the average interarrival time~($\mathbb{I}$) between blocks for validating transactions. A trivial increase in validation time~($\tau$) introduces the popularly known Verifier's Dilemma, and as we demonstrate, causes more forking and increases unfairness. Large $\tau$ also reduces the tolerance for safety against a Byzantine adversary. Solutions that offload validation to a set of non-chain nodes (a.k.a. off-chain approaches) suffer from trust issues that are non-trivial to resolve. In this paper, we present Tuxedo, the first on-chain protocol to theoretically scale $\tau/\mathbb{I} \approx 1$ in PoW blockchains. The key innovation in Tuxedo is to separate the consensus on the ordering of transactions from their execution. We achieve this by allowing miners to delay validation of transactions in a block by up to $\zeta$ blocks, where $\zeta$ is a system parameter. We perform security analysis of Tuxedo considering all possible adversarial strategies in a synchronous network with end-to-end delay $\Delta$ and demonstrate that Tuxedo achieves security equivalent to known results for longest chain PoW Nakamoto consensus. Additionally, we also suggest a principled approach for practical choices of parameter $\zeta$ as per the application requirement. Our prototype implementation of Tuxedo atop Ethereum demonstrates that it can scale $\tau$ without suffering the harmful effects of naive scaling in existing blockchains.

翻译：基于 Work- 证据 ~ (PoW) 的块链通常只在用于验证交易的区块间分配一个最小的跨端时间( 美元\ mathbb{ I} 美元) 中, 平均跨端时间 ~ ( $\ tau$) 中, 校验时间 ~ ($\ tau$) 中稍有增加, 引出众所周知的 Verationeration 的 Dilemmma ($) 中, 导致更多反向和增加不公平。 大 美元 也降低了对拜占链对手的安全容忍度 。 将验证值卸下至一套非链式节点的解决方案 (a. k. a. a.