  This paper first describes an `obfuscating' compiler technology developed for
encrypted computing, then examines if the trivial case without encryption
produces much-sought indistinguishability obfuscation.
