Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Multi-Round Visibility: A Post-Consensus Ordering Layer for DAG-Based BFT
Pengkun Ren, Dong Hai, Nasrin Sohrabi +1
Directed acyclic graph (DAG)-based Byzantine Fault-Tolerant (BFT) protocols achieve high throughput by decoupling dissemination from agreement and allowing many vertices to be comm…
cs.DC2025
Proof-Carrying Fair Ordering: Asymmetric Verification for BFT via Incremental Graphs
Pengkun Ren, Hai Dong, Nasrin Sohrabi +2
Byzantine Fault-Tolerant (BFT) consensus protocols ensure agreement on transaction ordering despite malicious actors, but unconstrained ordering power enables sophisticated value e…
cs.DC2025
Efficient and Secure Sleepy Model for BFT Consensus
Pengkun Ren, Hai Dong, Zahir Tari +1
Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Ex…