pi^4 + pi^5 = e^6
Well, to five decimal places, anyway. Some other good ones: e^pi - pi = 20
sqrt(2) ln pi = phi
There are also famous "almost integers" such as this one discovered by Ramanujan: e^(pi sqrt(163))
Which is an integer to 12 decimal places. [INPUT][ENCRYPTED STATE][OUTPUT]
[ 2 ][r7K4LmP2XcQ9aWd][ ]
[ + ][Fv0bHsR8mYnT3kL][ ]
[ 2 ][Qx6NpZa1JdUw5Ce][ ]
[ = ][hM9yLg2RsXf7BtP][ ]
[ ][wK3nVc8DpQe1YrH][ 4 ]
With each cycle, one input token and encrypted state would be fed into some known function and produce one output token (possibly null) and a new encrypted state. It would be a true "black box" program; the hardware or entity running it can choose what input to feed it, but can never inspect or modify the internals, only the output. Unfortunately, they would still be able to "reset" the agent to any earlier checkpoint, or feed it arbitrary (false) input. So its not perfect. Also, as far as I know, no current FHE scheme works this way, and I don't know how to write one. df.filter(pl.col("status") == "active")
In numpy, `x == y` return a boolean vector of the same shape as x and y, comparing them element-wise. English -> Rust -> ASM -> Machine Code
What's one more layer, right?
https://aem1k.com/qlock/
I reverse engineered it to a unobfuscated version a few years ago:
https://gist.github.com/olooney/a89db3932b089925b71b68d7e9f2...
He's done a ton of other great ASCII visualizations as well:
https://aem1k.com/