Composable Formal Verification Secures DAG Consensus Protocols Efficiently
A new compositional framework enables proof reuse across diverse DAG protocols, practically halving the effort for provable, architectural security.
DeepFold Optimizes Zero-Knowledge Proofs with Efficient Multilinear Commitments
DeepFold, a new Reed-Solomon-based polynomial commitment scheme, achieves optimal prover time and concise proofs, unlocking practical, large-scale verifiable computation.
Blockchain Designated Verifier Proofs Ensure Non-Transferable Privacy on Public Ledgers
The Blockchain Designated Verifier Proof (BDVP) uses a verifier-held trapdoor to simulate fake proofs, restoring non-transferable privacy to ZKPs on public chains.
Proof-of-Retrievability Chains Secure Stateless Client Data Access
Introducing Verifiable Retrieval Tags, a novel primitive securing data availability and enabling truly stateless light clients without complex sampling overhead.
Sublinear Vector Commitments Enable Trustless Stateless Data Availability
A new vector commitment scheme allows light clients to verify massive datasets with logarithmic communication, fundamentally solving the stateless data availability problem.
Deterministic Bounds Secure Committee Selection, Strengthening Decentralization and Scalability
By replacing probabilistic committee selection with deterministic bounds, this new sortition mechanism guarantees an honest majority, enhancing consensus security and network scalability.
Lattice Polynomial Commitments Unlock Concretely Efficient Post-Quantum Zero-Knowledge Arguments
A new lattice-based polynomial commitment scheme drastically shrinks proof size, providing the essential, quantum-safe primitive for future scalable blockchain privacy.
LLM-driven Program Partitioning Prevents Smart Contract Data Leakage
LLM-driven program partitioning isolates sensitive contract data, mathematically preventing manipulation attacks and securing decentralized applications.
Uncertified DAG Consensus Achieves Optimal Three-Round Finality and Sub-Second Latency
The Mysticeti protocol uses uncertified DAG blocks and a novel commit rule to reach the theoretical three-round latency limit, unlocking true sub-second finality for high-throughput chains.
