piotr93

Woah super interesting, I didn't know about this. Will def read it! Seems like I was wrong?

The only computations that an LLM does are backprops and forward passes. It can not run any arbitrary program description. Yes, it will hallucinate your program's output if you feed it some good enough starting prompt. But that's it.

Yes an llm could do it since it can predict the next token for pretty much anything. But what's the error margin you are ready to tolerate?

I was not clear enough, thanks. Whether it is a pok or zk depends on the chosen signature scheme. In any case, zk signature schemes exist and are implied by the existence of one way functions and publicly verifiable nizk

A signature is a zkp. So your example is also a good example :)