3 ms·
If your "script" is Turing-complete and the remote nodes can't be trusted, there is no solution due to the halting problem. You can't verify correctness of an a
by pshirshov 3y ago
If your "script" is Turing-complete and the remote nodes can't be trusted, there is no solution due to the halting problem. You can't verify correctness of an arbitrary function output w/o evaluating it step by step.
Also any obfuscation can be removed and any compiled code can be decompiled.
- traverseda 3y agohomomorphic encryption and trusted compute platforms not withstanding (neither actually works). Maybe zero knowledge proofs?
- avgcorrection 3y agoI wasn't getting at the Halting Problem or program analysis...