Simple-IT: Practical Low-Latency Signature-Free BFT Consensus
summary
The gist
Simple-IT proposes a new leader-based, signature-free BFT consensus protocol that achieves theoretical latency of 4 message delays (one more than the optimum) and only 3 on its optimistic path…
This episode discusses
- Simple-IT: Practical Low-Latency Signature-Free BFT Consensus · Paper Radio
- Shoal++: High Throughput DAG BFT Can Be Fast!
- Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
- Optimistic, Signature-Free Reliable Broadcast and Its Applications
- Raptr: Prefix Consensus for Robust High-Performance BFT
The paper
Simple-IT: Practical Low-Latency Signature-Free BFT Consensus · Read on arXiv
Qianyu Yu, Juan Villacis, Giuliano Losa, Zhuolun Xiang, Xuechao Wang
The Hong Kong University of Science and Technology · University of Bern · Stellar Development Foundation · Aptos Labs
Transcript
Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: We're looking at the paper: "Simple-IT: Practical Low-Latency Signature-Free BFT Consensus".
Jane: Here's the gist of the paper. Simple-IT proposes a new leader-based, signature-free BFT consensus protocol that achieves theoretical latency of 4 message delays (one more than the optimum) and only 3 on its optimistic path, while matching the throughput and latency of state-of-the-art quantum-vulnerable protocols experimentally <ref:2606.14404#pg2> Recent advances in quantum computing pose a looming threat to most current Byzantine fault-tolerant (BFT) consensus protocols, which rely on quantum-vulnerable publickey signature schemes such as Ed25519 and BLS12-381 <ref:2606.14404#pg2>.
Tom: Instead of switching to much more expensive post-quantum secure signature schemes, an alternative is to use signaturefree protocols, which rely only on cheap, post-quantum secure authenticated channels <ref:2606.14404#pg2>.
Jane: While previous work on the Sailfish++
35: protocol showed that stateof-the-art throughput is attainable signature-free, the question of latency is still open <ref:2606.14404#pg2>.
Tom: Protocol Design and Latency Characteristics Simple-IT achieves a good-case latency of 4 message delays when paired with Bracha’s RBC protocol
7: , and only 3 message delays on its optimistic path when paired with Opt-RBC <ref:2606.14404#pg2>.
Title and authors: Jane: So, to recap, this paper "Simple-IT: Practical Low-Latency Signature-Free BFT Consensus" explores whether signature-free consensus protocols can match the performance of current state-of-the-art quantum-vulnerable BFT protocols.
Tom: It's about asking if we can get the same throughput and latency without using those costly public key signatures, which they suggest is a viable path because it relies only on cheap authenticated channels.
Lu: The core idea seems to be adapting the Simplex protocol to this signature-free setting by replacing quorum certificates with convergence mechanisms that aren't needed, which is a smart way to simplify things.
Meng: I wonder how much of that simplification actually helps when you have a lot of Byzantine faults, because those convergence mechanisms usually come with their own complexity tradeoffs.
Lalam: The paper lays out the protocol variants S and Sopt, and it shows that when paired with specific reliable broadcast protocols, they achieve good-case latencies of four message delays and optimistic latencies of three message delays.
The paper's summary: Tom: So what this means for us practically is that they achieved a good-case latency of four message delays when Simple-IT is paired with Bracha’s RBC protocol, which is pretty solid for a leader-based system.
Jane: And if you look at the optimistic path, when they use Opt-RBC, the latency drops to only three message delays as long as at least approximately 5n six parties behave correctly when n equals three f <ref:2606.14404#pg2>.
Lu: That three message delay is significant because it's the theoretical lower bound for tolerating more than one failure, even for protocols that still use signatures, and Simple-IT hits it at the cost of slightly bigger optimistic path quorums than signature-based protocols do.
Meng: Bigger quorums mean more messages to send in the optimistic scenario, so I’m worried about how much bandwidth that translates to when we're running this on a geo-distributed testbed.
Lalam: They also introduced the Reliable Notification protocol, which is novel and guarantees that if every correct party raises an outcome, all correct parties eventually confirm it without needing those traditional certificates.
The paper's improvements: Tom: The authors suggest several specific improvements, like using Reliable Broadcast to notarize blocks and then finalizing them in just one more message delay to get that good-case commit latency down to one RBC plus one delta.
Jane: They also showed how they can use speculative proposal mechanisms, calling them S s and S s opt variants, which allow leaders to propose speculatively before they know if the previous round's proposal was safe.
Lu: This speculative pipeline allows for a proposal pipeline of depth k, which enables a good-case block time of one delta or an optimistic block time of one delta when at most fo parties are faulty.
Meng: If you can reduce the block time to just one delta on the optimistic path, that's much better for real-time data processing pipelines where you need fast feedback loops.
Lalam: They also showed how the shared-mempool design has a substantially lower outgoing bandwidth cost per committed transaction compared to leader-driven erasure-coded RBC, which is a huge win for the network overhead.
Conclusion: Tom: To wrap up, Simple-IT demonstrates that postquantum security in BFT consensus doesn't have to sacrifice performance, and signature-free protocols are a practical way to build quantum-safe systems.
Jane: The key results are the latency numbers: four message delays good case with BrachaRBC, and three message delays on the optimistic path with Opt-RBC when at most fo parties are faulty.
Lu: The implication is that you can have high performance in replicated AI systems without needing to switch to much more expensive post-quantum signature schemes, provided you use these specific reliable broadcast implementations.
Meng: For deployment, the empirical results show that Mempool-Simple-IT actually surpasses Autobahn on both latency and throughput axes, peaking at one hundred seventy thousand transactions per second at roughly zero point five seconds of latency.
Lalam: And we have to remember the limitation they mentioned: their optimistic block time for Simple-IT variants S and Sopt is three delta and two delta respectively when at most fo parties are faulty.
Tom: So, in a nutshell, Simple-IT gives us a practical path toward high-performance quantum-safe replicated systems by using signature-free methods instead of expensive signatures.
More episodes
- 2505.16254-Human-AI Writing as Distributed Cognition: Reassessing Collaborative Writing Theories in the Age of LLMs
- 2506.10913-Choreographic Quick Changes: First-Class Location (Set) Polymorphism
- 2507.14812-A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
- 2507.15448-Frames over finite fields with respect to the Galois inner product and their connections to self-orthogonal and LCD codes
- 2508.21572-NewsReX: An Open-Source Multi-Framework for Neural News Recommendation
- 2509.17028-Impact of Packetization on Network Calculus Analysis
- 2510.17342-AoA Services in 5G Networks: A Framework for Real-World Implementation and Systematic Testing
- 2511.04088-Efficient and rate-optimal list-decoding in the presence of minimal feedback
- 2511.17264-Notes on Stack Machines and Quantum Stack Machines
- 2601.15318-On the closest balanced game