Fraud and data availability proofs: detecting invalid blocks in light clients
From MaRDI portal
(Redirected from Publication:2147248)
Recommendations
Cites work
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 1026591 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Asymptotic Enumeration Methods for Analyzing LDPC Codes
- Coded Merkle tree: solving data availability attacks in blockchains
- Impossibility of distributed consensus with one faulty process
- New multilevel codes over GF(q)
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions
Cited in
(9)- FRIDA: data availability sampling from FRI
- Plumo: an ultralight blockchain client
- SoK: blockchain light clients
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Coded Merkle tree: solving data availability attacks in blockchains
- Cryptoeconomic security for data availability committees
- Proof of necessary work: succinct state verification with fairness guarantees
- Proof of availability and retrieval in a modular blockchain architecture
- Asymptotically optimal message dissemination with applications to blockchains
This page was built for publication: Fraud and data availability proofs: detecting invalid blocks in light clients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147248)