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://www.oranlooney.com/quotes/
I've did something similar to your 3D viewer once, but for all possible solutions to the Soma cube:
https://www.oranlooney.com/demos/soma-forest/
The way that works is it uses t-SNE to embed the solutions in a 2D manifold based on similarity. This is completely different than John Conway's SOMAP solution.
In theory I could do something similar for quotes, passing each through an embedding model, computing the n^2 semantic distances, and using t-SNE to flatten that to 3D manifold, and using the resulting point to select the row, book, and shelf in a library.
Are you planning to make your 3D library code open source?