M-Bounded Fairness Guarantees Asynchronous Consensus in Dynamic Networks
Foundational research introduces m-bounded fairness, a constructive liveness property that ensures consensus convergence in asynchronous, dynamic systems.
Trapdoored Matrices Enable Fast Secure Data-Oblivious Linear Algebra Delegation
Researchers introduce Trapdoored Matrices, a new cryptographic primitive that uses LPN to achieve fast, data-oblivious linear algebra delegation, fundamentally unlocking private on-chain AI.
Batch Processing AMM Achieves Arbitrage Resilience and Strategy Proofness
This new batch-clearing AMM mechanism formally eliminates miner extractable value by settling all trades at a single price, ensuring strategy-proof execution.
One-Time Batched Threshold Decryption Achieves Practical, Scalable Mempool Privacy
This new batched threshold decryption primitive enables practical MEV mitigation by securing transactions with a one-time cryptographic setup and constant-size partial decryptions.
Deterministic Sortition Bounds Fortify Committee Security and Scalability
A new cryptographic sortition method achieves deterministic bounds on adversarial committee influence, fundamentally enhancing Proof-of-Stake security and decentralization.
Logarithmic Zero-Knowledge Proofs Eliminate Trusted Setup for Private Computation
Bulletproofs introduce non-interactive zero-knowledge proofs with logarithmic size and no trusted setup, fundamentally solving the proof-size bottleneck for on-chain privacy.
Collaborative Mining Protocol Fortifies Proof-of-Stake against Long-Range History Rewrites
PoC introduces a collaborative, resource-efficient cryptographic puzzle to prevent long-range attacks, guaranteeing immutable ledger history for PoS/BFT chains.
Prefix Consensus Unifies BFT Latency Throughput Robustness
Raptr's prefix consensus integrates leader-based low latency with DAG-based high throughput, resolving a core BFT trade-off for scalable systems.
Constant-Size Timed Signatures Revolutionize Verifiable Future Transaction Execution
This new VTS primitive achieves constant-size proof overhead using RSA and TVDF, fundamentally unlocking efficient time-locked on-chain applications.
