The reason "Reflections on Trusting Trust" is famous is that it vividly demonstrates the Halting Problem (or Rice's Theorem if you prefer).
There's no general way to write a program that will look at another program and pronounce it "safe" for some definition of "safe."
Likewise there's no general, automatic way to prove every output of an LLM is "safe," even if you run it through another LLM. Even if you run the prompts through another LLM. Even if you run the code of the LLM through an LLM.
Yes it's fun to try. And yes the effort will always ultimately fail.
There's no general way to write a program that will look at another program and pronounce it "safe" for some definition of "safe."
Likewise there's no general, automatic way to prove every output of an LLM is "safe," even if you run it through another LLM. Even if you run the prompts through another LLM. Even if you run the code of the LLM through an LLM.
Yes it's fun to try. And yes the effort will always ultimately fail.