FlyClient: Super-Light Clients for Cryptocurrencies
Benedikt Bünz, Lucianna Kiffer, Loi Luu, Mahdi Zamani
摘要
To validate transactions, cryptocurrencies such as Bitcoin and Ethereum require nodes to verify that a blockchain is valid. This entails downloading and verifying all blocks, taking hours and requiring gigabytes of bandwidth and storage. Hence, clients with limited resources cannot verify transactions independently without trusting full nodes. Bitcoin and Ethereum offer light clients known as simplified payment verification (SPV) clients, that can verify the chain by downloading only the block headers. Unfortunately, the storage and bandwidth requirements of SPV clients still increase linearly with the chain length. For example, as of July 2019, an SPV client in Ethereum needs to download and store about 4 GB of data.Recently, Kiayias et al. proposed a solution known as noninteractive proofs of proof-of-work (NIPoPoW) that allows a light client to download and store only a polylogarithmic number of block headers in expectation. Unfortunately, NIPoPoWs are succinct only as long as no adversary influences the honest chain, and can only be used in chains with fixed block difficulty, contrary to most cryptocurrencies which adjust block difficulty frequently according to the network hashrate.We introduce FlyClient, a novel transaction verification light client for chains of variable difficulty. FlyClient is efficient both asymptotically and practically and requires downloading only a logarithmic number of block headers while storing only a single block header between executions. Using an optimal probabilistic block sampling protocol and Merkle Mountain Range (MMR) commitments, FlyClient overcomes the limitations of NIPoPoWs and generates shorter proofs over all measured parameters. In Ethereum, FlyClient achieves a synchronization proof size of less than 500 KB which is roughly 6,600x smaller than SPV proofs. We finally discuss how FlyClient can be deployed with minimal changes to the existing cryptocurrencies via an uncontentious velvet fork.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper8
- Many-out-of-Many Proofs and Applications to Anonymous ZetherBenjamin E. DiamondS&P 2021 · 被引用 38 次
- Mining in Logarithmic SpaceAggelos Kiayias, Nikos Leonardos, Dionysis ZindrosCCS 2021 · 被引用 13 次
- Vizard: A Metadata-hiding Data Analytic System with End-to-End Policy ControlsChengjun Cai, Yichen Zang, Cong Wang, Xiaohua Jia 等CCS 2022 · 被引用 12 次
- Alba: The Dawn of Scalable Bridges for BlockchainsGiulia Scaffino, Lukas Aumayr, Mahsa Bastankhah, Zeta Avarikioti 等NDSS 2025
- Differential Trust: Dynamic Multi-Authority Anonymous Credentials with Epoch-Weighted UpdatesChen Li, Jianting Ning, Xiulong Liu, Yulin LiuUSENIX Security 2026
它引用的顶会 Paper3
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly 等S&P 2018 · 被引用 1,145 次
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 被引用 1,084 次
- A Better Method to Analyze Blockchain ConsistencyLucianna Kiffer, Rajmohan Rajaraman, Abhi ShelatCCS 2018 · 被引用 149 次
相关 Paper
- Mining in Logarithmic Space with Variable DifficultyLoïc Miller, Dorian Pacaud, Nathanël Derousseaux-Lebert, Emmanuelle Anceaume 等CCS 2025
- EncELC: Hardening and Enriching Ethereum Light Clients with Trusted EnclavesChengjun Cai, Lei Xu, Anxin Zhou, Ruochen Wang 等INFOCOM 2020 · 被引用 18 次
- An Incremental PoSW for General Weight DistributionsHamza Abusalah, Valerio CiniEUROCRYPT 2023 · 被引用 8 次
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- Sprints: Intermittent Blockchain PoW MiningMichael Mirkin, Lulu Zhou, Ittay Eyal, Fan ZhangUSENIX Security 2024 · 被引用 8 次
