Folding Schemes Enable Fastest Recursive Zero-Knowledge Arguments
The Nova folding scheme dramatically accelerates verifiable computation by deferring all intermediate proof checks into a single, succinct final argument.
BFT Consensus Enables Practical Decentralized Distributed Key Generation
A new framework operationalizes Distributed Key Generation using BFT consensus as a broadcast channel, enabling trustless threshold cryptography for decentralized systems.
Multi-Layered Stratification Provides Consistent Methodology for Measuring True Decentralization
A stratified, eight-layer methodology and a Minimum Decentralization Test now formally measure and unify the contested semantics of blockchain decentralization.
ZKPoT Consensus Secures Federated Learning by Verifying Model Performance Privately
ZKPoT consensus leverages zk-SNARKs to prove model performance without revealing data, creating a privacy-preserving, performance-based leader election mechanism.
Constant Latency BFT Achieved on Dynamically Available Directed Acyclic Graphs
New DAG-based BFT protocol guarantees constant finality time despite validators frequently sleeping, solving a core dynamic availability problem.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
Vector Commitments Enable Constant-Time Data Availability Proofs for Stateless Clients
This new Vector Commitment primitive achieves $O(1)$ data availability proof verification, fundamentally decoupling light client security from network throughput limits.
Searcher-Auction Mechanism Solves Transaction Fee Incentive Impossibility
Mechanism design incorporating searchers is a theoretical necessity to achieve incentive-compatible transaction fee mechanisms and high social welfare simultaneously.
Scalable Collaborative zk-SNARKs Decouple Proving from Centralization and Resource Bottlenecks
Collaborative zk-SNARKs distribute the prover's work across multiple servers, achieving a 30x speedup and 16x larger circuits for mass-scale verifiable computation.
