Show HN: Obfuscation Tool for Mixed Boolean Arithmetic Expressions

Since you're not increasing the number of variables, it seems to me that the problem of finding the initial Boolean formula (or an even simpler version of it) is fairly straightforward. Have you done any tests along these lines?

Example of output: <a href="https:&#x2F;&#x2F;github.com&#x2F;seekbytes&#x2F;pocket#example">https:&#x2F;&#x2F;github.com&#x2F;seekbytes&#x2F;pocket#example</a><p>Mixed Boolean Arithmetic refers to expressions which include boolean, and arithmetic operations (AND, OR, XOR, PLUS, MINUS, MULTIPLY..). Let an expression be something like A + B. My tool applies some transformations to re-write this expression in more complex terms (such as ((A &amp; B) + (A | B))).<p>Let me know if you have any questions!