= 27d567bc2d48d9f40e9ccc20ea370b15)
wwa comments on Saving the World - Progress Report - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (47)
I'm developing a low-level strongly typed virtual machine suitable for running thought processes with provable program properties, and which result in checkable partial execution traces with cryptographically strong bounds on honest vs fraudulent work. Such a framework meets the needs for a strong AI boxing setup.
You may want to talk to these guys: http://www.scipr-lab.org/pub (SNARKs for C)
And to me as well, in due time.
I am aware of their work, being as I am a bitcoin core developer working on the related areas of privacy enhancement and script extensions. What I was alluding to is not pairing cryptography though as that is much too slow for this application, and ultimately not interesting in the context of self-modifying programs. It is something much simpler having to do with one way hashes of the result then pruning the execution trees in such a way that cannot be cheated within the bounds of execution time, which can be compared with energu usage. in other words have the program give a concise summary of its execution thought processes which led to the result it gives in such a way that it can't be hiding things.
what are you working on?