重新定义比特币轻钱包验证机制，证明其安全且最优
Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds
- 从零构建形式化SPV协议，基于符号自动机与默克尔验证
- 在部分连接和恶意网络下，证明协议在经济安全边界内运行
- 提出低带宽优化，适合移动设备等资源受限场景
本文对比特币白皮书中原始的简化支付验证（SPV）协议进行了完整的形式化规范、协议描述和数学证明。与流行实现中的误解相反，我们证明SPV在有界敌手假设下不仅安全，而且在需要可扩展验证交易包含的数字现金系统中严格最优。协议从基本原理重建，验证模型建立在符号自动机、默克尔成员关系和链式证明优势谓词之上。通过严格的概率与博弈论分析，推导出协议安全运行的经济边界，并在部分连接、敌对中继网络和恶意传播延迟条件下验证其存活性与安全性。规范还引入自适应轮询和压缩头同步等低带宽优化，同时保持正确性。本文既为安全的SPV实现提供蓝图，也驳斥了关于非验证客户端的常见误解。
原文摘要 · Abstract (English)
This paper presents a complete formal specification, protocol description, and mathematical proof structure for Simplified Payment Verification (SPV) as originally defined in the Bitcoin whitepaper \cite{nakamoto2008}. In stark contrast to the misrepresentations proliferated by popular implementations, we show that SPV is not only secure under bounded adversarial assumptions but strictly optimal for digital cash systems requiring scalable and verifiable transaction inclusion. We reconstruct the SPV protocol from first principles, grounding its verification model in symbolic automata, Merkle membership relations, and chain-of-proof dominance predicates. Through rigorous probabilistic and game-theoretic analysis, we derive the economic bounds within which the protocol operates securely and verify its liveness and safety properties under partial connectivity, hostile relay networks, and adversarial propagation delay. Our specification further introduces low-bandwidth optimisations such as adaptive polling and compressed header synchronisation while preserving correctness. This document serves both as a blueprint for secure SPV implementation and a rebuttal of common misconceptions surrounding non-validating clients.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。