[论文解读] A Scale-out Blockchain for Value Transfer with Spontaneous Sharding
本文提出一种用于价值转移的可扩展区块链,通过利用链下交易记录和本地可执行验证,实现无需牺牲去中心化或安全性的自发分片。节点仅存储和传输证明双花抵抗所需的最小证明,根据理性行为动态形成分片,从而实现次线性通信成本和可扩展吞吐量。
Bitcoin, as well as many of its successors, require the whole transaction record to be reliably acquired by all nodes to prevent double-spending. Recently, many blockchains have been proposed to achieve scale-out throughput by letting nodes only acquire a fraction of the whole transaction set. However, these schemes, e.g., sharding and off-chain techniques, suffer from a degradation in decentralization or the capacity of fault tolerance. In this paper, we show that the complete set of transactions is not a necessity for the prevention of double-spending if the properties of value transfers is fully explored. In other words, we show that a value-transfer ledger like Bitcoin has the potential to scale-out by its nature without sacrificing security or decentralization. Firstly, we give a formal definition for the value-transfer ledger and its distinct features from a generic database. Then, we introduce an off-chain based scheme with a shared main chain for consensus and an individual chain for each node for recording transactions. A locally executable validation scheme is proposed with uncompromising validity and consistency. A beneficial consequence of our design is that nodes will spontaneously try to reduce their transmission cost by only providing the transactions needed to show that their transactions are double-spending-proof. As a result, the network is sharded as each node only acquires part of the transaction record and a scale-out throughput could be achieved, which we call "spontaneous sharding".
研究动机与目标
- 解决传统区块链因要求所有节点存储和验证完整交易集而带来的可扩展性限制。
- 在保持强安全保证和完全去中心化的同时,实现可扩展吞吐量。
- 将价值转移账本(VTL)模型形式化,以区别于通用型区块链。
- 设计一种系统,使节点通过最小化传输成本并基于证明的验证机制自发分片。
- 证明自发分片可在不引入验证者或中心化机构的前提下实现。
提出的方法
- 提出双链架构:共享主链用于共识,每个节点拥有独立的本地链用于交易记录。
- 采用本地可执行验证机制,每个节点仅基于确保双花抵抗所必需的最小证明来验证交易。
- 依赖理性节点行为驱动自发分片:节点通过仅传输必要证明来优化,以减少通信成本。
- 使用Netty和Tendermint进行概念验证模拟,评估在不同连通性(c)和节点数(N=10至25)下的网络行为。
- 应用一种简单的智能交易算法,根据证明可用性将交易路由至最优源节点。
- 采用基于证明的框架,交易有效性由有效证明链的存在决定,而非对全局交易集的访问。
实验结果
研究问题
- RQ1是否可能在不牺牲去中心化或安全性的情况下,实现价值转移区块链的可扩展性?
- RQ2是否可能在不要求所有节点存储完整交易集的前提下防止双花?
- RQ3在去中心化系统中,自发分片是否能自然地从理性节点行为中涌现?
- RQ4在基于证明的验证模型下,通信成本如何随网络规模扩展?
- RQ5自发分片在何种条件下会失败,以及如何缓解这些情况?
主要发现
- 当节点连通性(c)较低时,自发分片会涌现,此时g < N,其中g为每个节点平均获取的链数。
- 对于N=10,15,20,25个节点,当c < 3,4,4,6时可实现自发分片;超过这些阈值后,所有节点获取全部链,失去可扩展优势。
- 系统保持了无妥协的一致性和有效性条件,确保所有诚实节点就交易有效性达成一致。
- 在低连通性条件下,每笔交易的通信成本随网络规模呈次线性扩展,从而实现真正的可扩展吞吐量。
- 模拟中使用的简单交易算法未完全发挥优化潜力,表明进一步改进可使g在更高c值下仍保持较低。
- 该系统支持未来扩展,如检查点机制以提升存储效率,以及私有通道以实现低延迟支付,且无需修改核心设计。
更好的研究,从现在开始
从阅读论文到最终审阅,大幅缩短您的研究时间。
无需绑定信用卡
本解读由 AI 生成,并经人工编辑审核。