ZKPoT Consensus Secures Decentralized Learning against Privacy and Centralization
A Zero-Knowledge Proof of Training consensus mechanism leverages zk-SNARKs to validate machine learning model performance privately, securing decentralized AI.
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.
Uncertified DAG Consensus Protocol Achieves Optimal Three-Round Latency
Mysticeti-C is the first DAG-based Byzantine consensus protocol to reach the theoretical lower bound of three message rounds, enabling sub-second finality.
Sequential Proof-of-Work Enables Competitive Decentralized Randomness Beacons
RandChain introduces Sequential Proof-of-Work to mandate non-parallelizable mining, securing public randomness and democratizing validator election.
Ethereum MEV-boost Flaw Exploited to Steal $25 Million during Block Validation
The MEV-boost vulnerability allows block manipulation for front-running and asset redirection, compromising transaction integrity and validator trust.
Adaptive BFT Achieves Sub-Second Finality with Dual Resilience Thresholds
Mercury BFT autonomously optimizes consensus latency using a dual resilience threshold, enabling planetary-scale finality in under 0.4 seconds.
Multi-Layered Stratification Provides Consistent Methodology for Measuring True Decentralization
A stratified, eight-layer methodology and a Minimum Decentralization Test now formally measure and unify the contested semantics of blockchain decentralization.
Shunning Secret Sharing Enables Optimal Asynchronous Agreement against General Adversaries
A novel Shunning Secret Sharing primitive enables the first almost-surely terminating Byzantine Agreement protocol secure against general, computationally-unbounded adversaries.
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.
