Seamless non-blocking reconfiguration with overlapping transition windows

Determine whether reconfigurations in asynchronous DAG-based Byzantine atomic broadcast can remain seamless and non-blocking when transition windows for successive membership changes are allowed to overlap.

Background

The protocol presented in the paper uses four-round transition windows and relies on the fact that distinct transition windows do not overlap. The authors explicitly leave unresolved whether the seamless, non-blocking reconfiguration property can be preserved if a subsequent membership change begins before the preceding transition window has fully ended.

References

Lastly, if a downgrade to a partially-synchronous model would invite even more elegant solutions.

— Seamless Reconfiguration for DAG-BFT  (2610.00896 - Hu et al., 1 Oct 2026) in Section 'Conclusion and Open Questions'

We conclude this paper with several open questions that we leave to future work: Firstly, is it possible to for reconfigurations to be seamless and non-blocking when transition windows are allowed to overlap.

— Seamless Reconfiguration for DAG-BFT  (2610.00896 - Hu et al., 1 Oct 2026) in Section 'Conclusion and Open Questions'