amoss
Joined 12 years ago
Joined 12 years ago
The claims:
* The existing exploits don't work. * Reasoning chains producing an exploit have cheated the test.
If the claims are wrong then rebutting them is easy:
* Ask an LLM to produce a real exploit. * Test it.
> I suspect that's possible without tripping over the halting problem. (But I can't prove it.)
I doubt that it is. For the language of proofs to be powerful enough to be able to express an arbitrary proof it would have be Turing Complete. Proving that a proof is the smallest proof of a given concept (i.e. there is no smaller human understandable proof) would then be proving the minimality of a program in a Turing Complete language.
Layering and placement of copyrighted materials to evade copyright.
The thing the dev should do that often doesn't get done is to take the information about the undesired behavior back up to the design/spec level and rework the definition to account for it. This doesn't normally get done because it takes longer and it is conceptually more difficult than the patch.
This is something that LLMs can accelerate significantly and the result is a shallower gradient of technical debt over the long term.