Uncertified DAGs Achieve Optimal Latency in Byzantine Consensus
A novel commit rule for uncertified Directed Acyclic Graphs revolutionizes consensus, ensuring immediate transaction finality and optimal latency in distributed systems.
Systematic Framework Optimizes Byzantine Fair Transaction Ordering and MEV Mitigation
A new systematic design guideline formalizes requirements for fair message ordering in Byzantine systems, enabling a critical latency optimization for FIFO protocols.
Asynchronous BFT Achieves Practical Performance through Designated Leaders
Alea-BFT combines designated leader efficiency with asynchronous resilience, creating a simple, highly performant BFT protocol that eliminates network timing assumptions.
Fair Consensus Factory Mitigates MEV through Order Neutrality
Research introduces the Fair Consensus Factory, a systemic framework to integrate order-fairness primitives into Byzantine consensus, directly addressing the foundational MEV problem.
Quantifying Fairness Granularity Mitigates MEV in Rollup Transaction Ordering
This mechanism introduces fairness granularity to FCFS sequencing, neutralizing network latency advantages and deterring spam for equitable transaction inclusion.
