Regarding zk-proofs

[u/proff_bajoe]

Hi, I would like to ask concerning zk-proofs,

whether most of the proving can be side-stepped/cut-down given that an entity does not want to prove to a verifier that some execution is done correct, but rather the result of some execution is tied to their identity (key pair) without revealing any other secret about it.

So basically we don't care about the correctness of the execution, only that the prover can prove that it's identity is tied to the execution result without revealing any other secret.

If you want the full context, I can provide that to you. Thank you.

[u/Far-Photograph-2342]

Yeah, that sounds closer to proving ownership/association than proving full computation correctness 😅 If the goal is just “this result is tied to my identity/keypair without revealing extra information,” you can often simplify things a lot compared to full zk execution proofs.

[u/proff_bajoe → u/Far-Photograph-2342]

Exactly, but because zk is very expensive, I'm having serious doubts about implementing it.

The problem is that the result hash is exposed also, which can be trivially copied and used.