Secure Multi‑Party Computation Solves the Cryptographic Boxes Problem for Unfriendly AI
Instead of slow homomorphic encryption, the post revives a 1980s solution—secure multi‑party computation (MPC)—that provides perfect secrecy without any computational assumptions and runs orders of magnitude faster. MPC lets us sandbox arbitrarily dangerous AIs while guaranteeing no party learns anything about the code, addressing Paul Christiano’s long‑standing ‘cryptographic boxes’ challenge.