Commit-and-Prove Zero-Knowledge Reduces Space Complexity for Large Circuits
Commit-and-Prove ZK is a new cryptographic primitive that enables memory recycling, dramatically reducing space complexity for large-scale verifiable computation.
Mutual-Assured-Destruction DAG Secures Consensus against MEV and Rushing
MAD-DAG introduces a ledger function that destroys block content on chain-length ties, mathematically eliminating selfish mining profitability under real-world MEV conditions.
Universal ZK-SNARKs Decouple Proof System Setup from Application Circuit Logic
Universal ZK-SNARKs replace per-circuit trusted setups with a single, continuously updatable reference string, boosting developer agility and security.
Differential Order Fairness Secures Atomic Broadcast against Transaction Reordering
The Quick Order-Fair Atomic Broadcast protocol introduces differential order fairness, achieving optimal resilience and quadratic message complexity to eliminate leader-based MEV.
Merkle Mountain Ranges Achieve Optimal Witness Update Frequency Lower Bound
This work establishes the theoretical lower bound for cryptographic accumulator witness updates, proving Merkle Mountain Ranges are structurally optimal for stateless blockchain verification.
Optimistic Rollups Secure Decentralized Federated Learning Model Integrity
This mechanism secures decentralized AI model aggregation by applying optimistic rollup fraud proofs to validate off-chain model weight updates, ensuring global model integrity.
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized AI
New VSS scheme EByFTVeS counters adaptive share delay attacks, significantly improving the security and efficiency of decentralized privacy-preserving computation.
Verifiable Data Commitment Decouples Scalability from Base Layer Bandwidth
The Verifiable Data Commitment primitive allows light clients to cryptographically verify massive data availability with constant overhead, solving the fundamental scalability bottleneck for decentralized systems.
Cryptographic Time-Locks and Distributed Sequencing Ensure Fair Transaction Ordering
A distributed sequencing committee uses Threshold Cryptography and Verifiable Delay Functions to cryptographically decouple ordering from the consensus proposer, eliminating MEV extraction.
