Could someone provide a better explanation (or a link to one) of the ZKP verifiable execution thing linked to in the post? <a href="https:&#x2F;&#x2F;people.xiph.org&#x2F;~greg&#x2F;simple_verifyable_execution.txt" rel="nofollow">https:&#x2F;&#x2F;people.xiph.org&#x2F;~greg&#x2F;simple_verifyable_execution.tx...</a><p>The notation is a bit weird, and I think I&#x27;m missing things here.<p>Some confusions:<p>- Are the AND gates actual AND gates which take in two bits and output one, or programming AND operations which operate on a couple of bytes at once?<p>- Why is the hash of the and gate encryption keys not reversible? At max the key is only a few bytes large, which is easy to brute force. If I&#x27;m interpreting these as actual AND gates, it&#x27;s a three bit key, which will neither be unique nor have a shred of security.<p>- &quot;I use the resulting super-commitment to select a random permutation of the encrypted gates.&quot;: What happened here? Were they just sorted by the superhash? Was the hash used as a seed in a PRNG? Would just shuffling them any which way be okay, or does the shuffle have to be such that the person the gates are sent to can verify that the shuffling was done &quot;correctly&quot;? This seems like a key point which was glossed over.<p>- I&#x27;m not entirely sure what role the revealing of the gates plays here. I assume that because of the deterministic shuffling above, it&#x27;s a nontrivial problem to do any jiggery-pokery with the nonrevealed gates without changing the shuffle order (and thus changing which gates are the ones not revealed)?<p>I sort of see how this works; but I&#x27;m not convinced that it&#x27;s secure.