arXiv:2506.01614cs.LGcs.AI2025-06

用对比学习优化比特币类区块链交易验证效率

Contrastive Learning for Efficient Transaction Validation in UTXO-based Blockchains

  • 通过对比学习构建交易输出嵌入空间,识别支出关系
  • 减少跨分片通信开销,提升吞吐量和可扩展性
  • 适合关注区块链扩容与智能路由的开发者

本文提出一种机器学习方法,用于提升基于UTXO的区块链(如比特币)的可扩展性。现有UTXO分片方案在分发UTXO时效率低,因父-子交易依赖关系导致大量通信开销,严重拖慢交易处理速度。本文方法不仅优化UTXO分片,还实现交易路由优化,确保交易被发送至包含其父UTXO的分片。核心是结合对比学习与无监督学习的框架,构建交易输出的嵌入空间,使模型能根据支出关系对输出进行分组。模型基于历史交易数据,采用三元组损失和在线半困难负样本挖掘训练,将父-子支出模式直接编码于参数中,从而避免耗时的实时父交易查找,显著降低跨分片通信开销,提升系统吞吐量与可扩展性。

原文摘要 · Abstract (English)

This paper introduces a Machine Learning (ML) approach for scalability of UTXO-based blockchains, such as Bitcoin. Prior approaches to UTXO set sharding struggle with distributing UTXOs effectively across validators, creating substantial communication overhead due to child-parent transaction dependencies. This overhead, which arises from the need to locate parent UTXOs, significantly hampers transaction processing speeds. Our solution uses ML to optimize not only UTXO set sharding but also the routing of incoming transactions, ensuring that transactions are directed to shards containing their parent UTXOs. At the heart of our approach is a framework that combines contrastive and unsupervised learning to create an embedding space for transaction outputs. This embedding allows the model to group transaction outputs based on spending relationships, making it possible to route transactions efficiently to the correct validation microservices. Trained on historical transaction data with triplet loss and online semi-hard negative mining, the model embeds parent-child spending patterns directly into its parameters, thus eliminating the need for costly, real-time parent transaction lookups. This significantly reduces cross-shard communication overhead, boosting throughput and scalability.

区块链对比学习可扩展性UTXO

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。