Decentralized Key Reveal Protocol Mitigates Front-Running with Minimal Latency
A new architecture for transaction encryption, F3B, uses a decentralized secret-management committee to reveal keys post-finality, eliminating front-running without high latency.
Proof of Useful Work Secures Consensus by Generating Zero-Knowledge Proofs
A new Proof of Useful Work protocol embeds zk-SNARK generation into consensus, solving PoW energy waste and bootstrapping a decentralized proof market.
One-Time Batched Threshold Decryption Achieves Practical, Scalable Mempool Privacy
This new batched threshold decryption primitive enables practical MEV mitigation by securing transactions with a one-time cryptographic setup and constant-size partial decryptions.
Ordered Consensus with Secret Random Oracle Mitigates Blockchain Ordering Attacks
Secret Random Oracles leverage Threshold VRFs to augment State Machine Replication, cryptographically enforcing fair transaction ordering.
Decentralized Auction and Encryption Mitigate MEV, Ensuring Equitable Transaction Ordering
FairFlow introduces a commit-reveal auction and randomized ordering to eliminate validator control over transaction sequencing, potentially restoring fairness to DeFi.
Cryptographic Randomness and Privacy Mitigate MEV Exploitation
Zero-knowledge proofs and verifiable randomness secure fair transaction ordering, eliminating front-running and democratizing extractable value.
Proof-of-Useful-Work Embeds Zero-Knowledge Proof Generation into Consensus
A new Proof-of-Useful-Work consensus protocol secures the chain by making general-purpose ZK-SNARK computation the core mining puzzle, democratizing verifiable computation.
