What happened
Researchers developed a new cryptographic protocol that lets multiple parties sum private data without revealing individual bits, using a mathematical structure called Birkhoff polytopes that makes inference computationally hard. The catch: the protocol can either be mathematically proven secure OR actually protect privacy in practice, but the current design cannot guarantee both at once.
Why it matters
This exposes a fundamental tension in how to build privacy-preserving systems — stronger mathematical hardness requires exposing more information to the aggregator, while hiding information weakens the hardness guarantees that make the system trustworthy. Until this tradeoff is resolved, any implementation has to choose between theoretical security and practical privacy protection.