Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds

The verification of transactions in blockchain networks presents a bifurcation in protocol implementation: one pathway aligns with complete state replication through full nodes, while the alternative, as outlined in Nakamoto's seminal whitepaper [1], advocates simplified payment verification (SPV) wherein clients validate transactions via header-only proofs. This paper formalises and mathematically models the latter, extending it beyond its conceptual origin into a fully specified, implementable, and security-provable protocol. In doing so, we consolidate foundational concepts from the original whitepaper, correct widespread misinterpretations, and construct a complete formal model using automata theory, game-theoretic reasoning, and complexity-theoretic metrics. This treatise employs a layered structure: beginning with an exegesis of the SPV concept as it appears in the original protocol specification, we examine the trajectory of mis-implementations, diverging threat models, and false economic assumptions. Subsequent sections provide a rigorous formalisation of SPV in a low-bandwidth adversarial context. This includes the introduction of protocol optimisations that conform to the Bitcoin protocol as defined in 2008, with proofs grounded in computational and information-theoretic primitives. Later sections analyse game-theoretic cost models for misbehaviour, followed by a discussion of implementation artefacts and evaluation in simulated hostile environments. The final structure includes appendices detailing code listings, mathematical proofs, and graphical models that substantiate the proposed design.