Time-Bound Signatures Cryptographically Enforce Transaction Expiry to Mitigate MEV
TB-Sig embeds a block height expiry into Schnorr signatures, granting users temporal control over transactions to fundamentally constrain block producer MEV extraction.
LLM Agents Shatter Classical BFT Bound via Confidence-Weighted Consensus
Confidence Probing-based Weighted BFT leverages LLM agents' inherent skepticism to exceed the classical $f < n/3$ fault tolerance limit, fundamentally enhancing consensus security.
Ethereum Exit Queue Confirms Network Stability and Higher Staking Yield
A massive withdrawal test proves Ethereum's security features work, creating a temporary supply shock that boosts staking rewards for all active validators.
Optimal Flexible Consensus Allows Client-Specific Safety-Liveness Trade-Offs
This new BFT construction enables clients to optimally select their safety-liveness resilience, fundamentally decentralizing the finality trade-off.
Differential Privacy Ensures Fair Transaction Ordering in State Machine Replication Systems
Foundational research links Differential Privacy to transaction ordering fairness, leveraging established noise mechanisms to eliminate algorithmic bias.
FRI Proximity Tests Enable Transparent Logarithmic Data Availability Sampling
FRI-based Data Availability Sampling provides a transparent, post-quantum path to scalable light client verification with logarithmic communication overhead.
Game Theory Formalizes MEV Competition and Mechanism Design Provides Mitigation
The foundational game-theoretic model establishes that MEV extraction is a Bertrand competition, requiring mechanism design solutions like commit-reveal to restore system welfare.
C-NORM Metric Formalizes Proof-of-Stake Bootstrapping Decentralization
Game theory defines ideal PoS bootstrapping with C-NORM, proving existing airdrop methods centralize and validating PoW-based stake distribution.
Rigorous Proof of Stake Security via Process Algebra
Formal modeling of probabilistic consensus using process calculus and noninterference verification provides mathematically provable security bounds against sophisticated attacks.
