Reusable Formal Verification Framework Secures Complex DAG-Based Consensus Protocols
A compositional TLA+ framework enables reusable, mechanized safety proofs for complex DAG consensus, fundamentally securing the next generation of high-throughput distributed ledgers.
Hybrid Synchronous Model Unlocks Optimal Low-Latency Byzantine Fault Tolerance
A new BFT protocol leverages a hybrid synchrony model to achieve up to 15x lower latency, preserving high fault tolerance for scalable decentralized systems.
Asymmetric Trust Model Secures DAG Consensus Protocols
Researchers generalize DAG consensus to an asymmetric trust model, enabling protocols to maintain security even when nodes hold non-uniform fault tolerance assumptions.
Optimal Resilience Asynchronous Secret Sharing with Linear Communication
Researchers introduce a new Asynchronous Verifiable Secret Sharing protocol, achieving linear communication complexity with optimal Byzantine resilience, foundational for scalable, trust-minimized computation.
Obfuscation Enables Deterministic Asynchronous Consensus Defying FLP Impossibility
Program obfuscation and time-lock puzzles overcome the FLP impossibility, yielding a deterministic consensus for asynchronous networks.
Federated Distributed Key Generation Secures Open Decentralized Networks
Federated Distributed Key Generation enables optional participation in threshold cryptography, securing large, dynamic decentralized systems.
Federated Distributed Key Generation Enables Threshold Cryptography in Open Networks
FDKG introduces heterogeneous trust to DKG, enabling robust threshold cryptosystems in open, asynchronous, and large-scale decentralized systems.
Deterministic Causal Structure Decouples Ledger Correctness from Ordering Policy
This theory introduces a Deterministic Causal Structure (DCS) where the ledger is a policy-agnostic DAG, resolving the entanglement of correctness and ordering.
Optimal Latency Consensus Achieves $2delta$ Communication by Eliminating Inter-Replica Messaging
A new consensus notion, Pod, eliminates inter-replica communication to achieve physically optimal 2δ latency, unlocking ultra-fast, censorship-resistant distributed applications.
Affine One-Wayness: Post-Quantum Temporal Verification via Polynomial Iteration
A new cryptographic primitive, Affine One-Wayness, establishes transparent post-quantum temporal ordering, enhancing distributed system security and synchronization.
Uncertified DAGs Achieve Optimal Latency in Byzantine Consensus
A novel commit rule for uncertified Directed Acyclic Graphs revolutionizes consensus, ensuring immediate transaction finality and optimal latency in distributed systems.