Formalizing Liveness Accountability Requires Honest Majority and Majority Synchrony
New theoretical framework precisely defines when and how consensus protocols can cryptographically blame nodes for stalling transaction finality.
Robust Distributed Arrays Secure Data Availability Sampling without Honest Majority
This research introduces Robust Distributed Arrays, a novel distributed data structure that secures the DAS networking layer against malicious actors without relying on an honest majority assumption.
Zero-Knowledge Mechanisms Enable Private Rules with Public Verifiability
This framework introduces a new cryptographic primitive that allows mechanism rules to remain secret while using ZKPs to publicly verify incentive compatibility and outcomes, removing the need for a trusted mediator.
Cryptographic Whistleblowing Secures Protocols against Smart Collusion Incentives
This research introduces Cryptographic Whistleblowing, a mechanism design primitive that uses provable on-chain penalties to enforce honesty against financially rational colluders.
Concurrent Proposers and Conditional Tips Enforce Economic Censorship Resistance
Introducing conditional tips across concurrent block proposers creates a mechanism design solution, establishing a Proposer's Dilemma to enforce timely transaction inclusion.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
Verifiable Decryption Secures Proposer-Builder Separation against Censorship
A new two-tiered architecture incorporates publicly verifiable decryption, resolving the censorship vulnerability inherent in existing block-building separation models.
Quadratic BFT Consensus Achieves Optimal Communication Complexity
SQuad introduces RareSync, a novel view synchronization primitive that reduces partially synchronous BFT communication complexity to the theoretical quadratic minimum.
