Two-Step Algorithm Decentralizes ZK-Rollup Proving, Securing Finality and Incentives
A new two-step submission algorithm for zero-knowledge proofs fundamentally decentralizes the ZK-Rollup prover role, eliminating single-node failure risk and distributing economic rewards.
Formalizing Subjective Trust Assumptions for Resilient Decentralized Consensus
Introducing asymmetric Byzantine quorum systems, this work formally proves safety and liveness in networks where nodes choose their own trust sets.
Validated Strong BFT Consensus Unlocks Scalable Asynchronous State Machine Replication
A novel Validated Strong BFT model permits leader-based coordination in asynchronous networks, dramatically reducing message complexity for scalable SMR.
Revelation Mechanisms Enforce Truthful Consensus in Proof-of-Stake
A game-theoretic revelation mechanism, triggered by block disputes, establishes a unique subgame perfect equilibrium, eliminating dishonest forks and enhancing PoS security.
Mechanism Design Replaces BFT Voting for Faster Consensus
A novel Simultaneous Report Mechanism is proposed to replace costly BFT voting, limiting consensus communication to two nodes for faster, dispute-triggered coordination and improved network liveness.
Zero-Knowledge Proofs Verify Cryptographic Hashing Integrity
A new ZKP methodology leverages Plonky2 to verifiably compute SHA-256 hashes, providing a trustless foundation for scalable blockchain data integrity.
Simplex Consensus Achieves Provably Fast, Simple Byzantine Fault Tolerance
This simplified BFT protocol achieves faster finality and the easiest known liveness proof, setting a new standard for decentralized system speed and simplicity.
Sub-Quadratic Broadcast Protocol Re-Defines Dishonest-Majority BFT Communication
A new cryptographic broadcast protocol achieves sub-quadratic communication in dishonest-majority networks, fundamentally scaling BFT consensus.
Asynchronous BFT Achieves Throughput-Oblivious Latency and Censorship Resistance
This new aBFT protocol resolves the fundamental throughput-latency tension by concurrently executing transaction dissemination and agreement, ensuring robust censorship resistance.
