Light clients for lazy blockchains

DOI10.1007/978-3-031-78679-2_1MaRDI QIDQ6979744zbMATH OpenFDO

Authors Ertem Nusret Tas, David N. C. Tse, Dionysis Zindros, Lei Yang

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78679-2_1

zbMATH Keywords

bisection gameeager blockchain protocols

Mathematics Subject Classification ID

Macroeconomic theory (monetary models, models of taxation) (91B64) Cryptography (94A60)

Cites work

• Compact Storage of Superblocks for NIPoPoW Applications
• Fraud and data availability proofs: detecting invalid blocks in light clients
• Non-interactive proofs of proof-of-work
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Plumo: an ultralight blockchain client
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Recursive proof composition from accumulation schemes
• Refereed delegation of computation
• Scalable zero knowledge via cycles of elliptic curves
• SoK: blockchain light clients
• The Bitcoin backbone protocol with chains of variable difficulty
• The Bitcoin Backbone Protocol: Analysis and Applications

This page was built for publication: Light clients for lazy blockchains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979744)