The fundamental challenge of distributed consensus is related to the principle of computational equivalence: as systems become more sophisticated to handle complex consensus requirements, they become computationally universal, which makes it impossible to formally prove they cannot do undesired things because such proofs would require solving the undecidable halting problem