Hybrid BFT Achieves Both Probabilistic Speed and Periodic Finality
Albatross combines speculative BFT's high throughput with Tendermint's periodic provable finality, resolving the performance-finality consensus trade-off.
Graded Broadcast Protocol Lowers Asynchronous BFT Latency Bypassing Agreement
The new Graded Broadcast primitive bypasses the costly agreement stage in Asynchronous BFT, fundamentally reducing consensus latency and enhancing throughput.
Multi-Linear Commitments Achieve Logarithmic ZK Proof Time
New multi-linear commitment scheme reduces ZK prover complexity to logarithmic time, fundamentally accelerating verifiable computation and on-chain privacy.
Application-Layer Mechanism Design Achieves Provable MEV Incentive Compatibility
A new AMM mechanism ensures provable incentive compatibility by maintaining a constant potential function, fundamentally eliminating application-layer MEV exploitation.
Generic Folding Scheme Enables Efficient Non-Uniform Verifiable Computation
Protostar introduces a generic folding scheme for special-sound protocols, drastically reducing recursive overhead for complex, non-uniform verifiable computation.
Proof Systems Replace Execution: The Verifiable Computation Paradigm
Cryptographic proofs fundamentally shift blockchain architecture from redundant distributed execution to a single, verifiable computation, enabling 1000x efficiency with mathematical certainty.
ZKPoT Secures Federated Learning Consensus and Model Privacy
The Zero-Knowledge Proof of Training (ZKPoT) mechanism leverages zk-SNARKs to validate model contributions without revealing data, resolving the privacy-efficiency conflict in decentralized AI.
SAKA Mechanism Circumvents Transaction Fee Impossibility Theorem
Research establishes a mechanism design impossibility for simple fee structures, then introduces the SAKA mechanism to achieve incentive-compatibility and high welfare by formalizing searcher roles.
Delivery-Fairness Secures Decentralized Randomness Beacons against Time-Advantage Attacks
Introducing delivery-fairness, a new formal property, rigorously quantifies and mitigates the time-advantage vulnerability in randomness beacons, ensuring protocol-level fairness.
