Jessica Taylor. CS undergrad and Master’s at Stanford; former research fellow at MIRI.
I work on decision theory, social epistemology, strategy, naturalized agency, mathematical foundations, decentralized networking systems and applications, theory of mind, and functional programming languages.
Blog: unstableontology.com
Twitter: https://twitter.com/jessi_cata
I assume it’s possible to have homomorphic encryption where the key is verifiable. Like if you randomly guessed it, you would be able to decrypt, and if you guessed wrong, you would know you failed to decrypt. The “key checking process” could even be memory-light. In which case it looks like in a “encrypt → compute → decrypt” process, the “decrypt” can’t be doing consciousness, because it’s a massively parallelizable, memory-light guess-and-check.