论文标题
封面：区块链的仅协作光节点验证和数据可用性
CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains
论文作者
论文摘要
验证区块链会导致重型计算，通信和存储成本。结果，资源有限的客户（称为轻节点）无法独立验证交易，必须信任完整的节点，使其容易受到安全攻击的影响。在这个问题的动机上，我们提出了一个基本问题：可以在没有任何完整节点的情况下安全地验证点点节点吗？我们通过提出覆盖范围来回答，这是一种分散的协议，即使在不诚实的多数下，一组光节点也可以协作验证块，从而达到了与完整节点相同的安全性安全性，而仅需要一小部分工作。特别是，每个节点的工作与参与者的数量（最多可达对数）成比例地缩小，从而导致计算，通信和存储要求，这些要求是跨块大小的sublinear。我们的主要贡献是用于欺诈证明和数据可用性的纯节点协议。
Validating a blockchain incurs heavy computation, communication, and storage costs. As a result, clients with limited resources, called light nodes, cannot verify transactions independently and must trust full nodes, making them vulnerable to security attacks. Motivated by this problem, we ask a fundamental question: can light nodes securely validate without any full nodes? We answer affirmatively by proposing CoVer, a decentralized protocol that allows a group of light nodes to collaboratively verify blocks even under a dishonest majority, achieving the same level of security for block validation as full nodes while only requiring a fraction of the work. In particular, work per node scales down proportionally with the number of participants (up to a log factor), resulting in computation, communication, and storage requirements that are sublinear in block size. Our main contributions are light-node-only protocols for fraud proofs and data availability.
