BEEFY Enables Efficient, Trustless Polkadot-Ethereum Bridging via Succinct Finality Proofs
BEEFY introduces a novel method for Ethereum light clients to efficiently verify Polkadot's finality, unlocking secure, low-cost cross-chain asset transfers and communication.
New Data Availability Sampling Paradigm: Uncoded Commitments, On-the-Fly Coding
This research introduces a novel data availability sampling method, enhancing blockchain scalability and security through dynamic, on-the-fly data encoding.
Constant-Size Polynomial Commitments Unlock Massively Scalable Data Availability Sampling
KZG, a polynomial commitment scheme, provides constant-sized cryptographic proofs, fundamentally enabling efficient Data Availability Sampling for scalable rollups.
PANDAS Protocol Secures Scalable Data Availability Sampling against Latency
PANDAS, a novel two-phase network protocol, leverages direct communication and PBS to meet the stringent 4-second deadline for large-scale data availability sampling.
Decoupled Vector Commitments Enable Sublinear Stateless Client Verification
A new Decoupled Vector Commitment primitive fundamentally lowers client verification cost from linear to sublinear time, enabling true stateless decentralization.
Robust Distributed Arrays Secure Data Availability Sampling without Honest Majority
This research introduces Robust Distributed Arrays, a novel distributed data structure that secures the DAS networking layer against malicious actors without relying on an honest majority assumption.
Decoupling Data Commitment from Coding Enhances Sampling Security
A new Data Availability Sampling paradigm commits to uncoded data, enabling on-the-fly coding for verification, which drastically strengthens light client security guarantees.
Logarithmic-Cost Data Availability Sampling Vector Commitments
Introducing a novel vector commitment scheme that reduces data availability proof size from linear to logarithmic, fundamentally unlocking scalable decentralized rollups.
Plonky2 Proves SHA-256 Integrity for Scalable Zero-Knowledge Blockchains
A new Plonky2-based methodology efficiently generates zero-knowledge proofs for SHA-256, solving a core computational integrity bottleneck for scaling ZK-Rollups.
