The thesis addresses the problem of scalability in decentralized blockchains in the context of the trade-off between transaction throughput and hardware requirements to participate in the network. Rollups are presented, that is technologies to verify on-chain blocks executed off-chain by minimizing the assumptions of trust. The variant of the Optimistic Rollups, in particular of Optimism and the use of invalidity proofs through interactive binary search and of the Validity Rollups, in particular of StarkNet, and the use of validity proofs through STARKs are discussed. Finally, the two solutions are compared on withdrawal time, on the cost of transactions and techniques to minimize it, on the possibility of applying the technology recursively, on compatibility with Ethereum and on the licenses used.
翻译:论文涉及在交易吞吐量和参加网络的硬件要求之间取舍的情况下分散式块块链的可扩展性问题; 论文介绍推式,即通过尽量减少信任的假设来核查链条中执行的链条的技术; 最佳推式推车的变式,特别是通过互动的二进制搜索和使用失效证明,特别是通过 StarkNet 进行交互的二进制搜索和有效性推车,以及通过STARKs 使用有效性证明; 最后,对退出时间、交易成本和尽量减少交易的技术、反复应用技术的可能性、与Etheum的兼容性以及所使用的许可证进行了比较。