Deterministic Bounds Strengthen Probabilistic Committee Selection for PoS Security
This research introduces deterministic bounds to cryptographic sortition, replacing probabilistic security with provable committee representation to enhance PoS robustness.
Neuromorphic Consensus Leverages Neural Dynamics for Energy-Efficient, Scalable Blockchain Finality
Proof-of-Spiking-Neurons introduces a new consensus class, modeling block proposal as competitive neural firing to achieve BFT security with minimal overhead.
Verifiable Delay Functions Fail Random Oracle Model Security
Foundational VDF security is disproven in the Random Oracle Model, forcing all future randomness and fair ordering protocols to rely on stronger, structured assumptions.
Formal MEV Certification Secures DeFi Protocols against Optimal Attacks
Mechanized formalization of MEV using the Lean theorem prover provides machine-checked proofs of extraction bounds, fundamentally securing DeFi protocol logic.
Adaptive Sharding and Zero-Knowledge Proofs Forge Efficient, Private Blockchain Architecture
Integrating zero-knowledge proofs with dynamic sharding fundamentally resolves the scalability-privacy tradeoff, enabling resilient, high-throughput systems.
Formal Compiler Proof Secures Distributed Cryptographic Applications Synthesis
A new compiler security proof unifies four formalisms to automatically synthesize complex, secure distributed protocols from simple sequential programs, guaranteeing end-to-end security.
Set Consensus Decouples Rollup Sequencing from Centralized Authority
The decentralized arranger leverages Set Byzantine Consensus to unify transaction ordering and data availability, eliminating the centralized sequencer bottleneck.
Zero-Knowledge Commitment Secures Private Mechanism Design and Verifiable Incentives
Cryptographic proofs enable a party to commit to a hidden mechanism while verifiably guaranteeing its incentive properties, eliminating trusted mediators.
Secure BFT Consensus for Dynamically Available Networks Using PVSS
A novel BFT protocol integrates PVSS with pre-commits to secure fast consensus in dynamic networks, achieving $4Delta$ latency and 50% resilience.
