Extend the algorithm to other communication models

Extend the smallest-enclosing-ball-based multidimensional Byzantine approximate agreement algorithm to other communication models, specifically dynamic networks and the network-agnostic model, while guaranteeing that all safe areas intersect under the respective network assumptions.

Background

The paper analyzes the proposed approximate agreement algorithms only in synchronous and asynchronous fully connected authenticated communication models. Its convergence analysis relies on establishing a common intersection among the safe areas computed by correct nodes.

The authors explicitly ask whether the algorithm can be extended to dynamic networks or to the network-agnostic model. They identify guaranteeing intersection of all safe areas under the differing network assumptions as the principal obstacle.