  We show that asynchronous $t$ faults Byzantine system is equivalent to
asynchronous $t$-resilient system, where unbeknownst to all, the private inputs
of at most $t$ processors were altered and installed by a malicious oracle.
  The immediate ramification is that dealing with asynchronous Byzantine
systems does not call for new topological methods, as was recently employed by
various researchers: Asynchronous Byzantine is a standard asynchronous system
with an input caveat. It also shows that two recent independent investigations
of vector $\epsilon$-agreement in the Byzantine model, and then in the
fail-stop model, one was superfluous - in these problems the change of $t$
inputs allowed in the Byzantine has no effect compared to the fail-stop case.
  This result was motivated by the aim of casting any asynchronous system as a
synchronous system where all processors are correct and it is the communication
substrate in the form of message-adversary that misbehaves. Thus, in addition,
we get such a characterization for the asynchronous Byzantine system.
