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.
Sub-Quadratic Sampling Secures Sharding, Advancing Decentralized Data Availability
A novel sub-quadratic data availability sampling technique enables asymptotically secure sharding, resolving the critical bottleneck for massive blockchain scaling.
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.
Field-Agnostic Polynomial Commitments Unlock Fast, Universal Zero-Knowledge Proofs
BaseFold generalizes FRI, introducing foldable codes to create a field-agnostic polynomial commitment scheme with superior prover and verifier efficiency.
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.
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.
Data Availability Encoding Yields Zero-Overhead Polynomial Commitments
By unifying data availability encoding with multilinear polynomial commitments, this research eliminates a major proving bottleneck, enabling faster verifiable computation.
Recursive Inner Product Arguments Enable Universal Transparent Polynomial Commitments
A novel recursive folding of polynomial commitments into Inner Product Arguments yields universal, transparent proof systems for highly scalable verifiable computation.
Decentralized ZK-Rollups Achieve Data Availability and MEV Resistance
A novel L2 architecture separates node roles and uses a Proof of Luck mechanism to secure decentralization and prevent transaction reordering attacks.
