The unclonable encryption problem: a six-year-old open problem in quantum cryptography.
Resolution reported — pending verification
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Assessment
Renown 2/5
A six-year focal open problem of the quantum cryptography community.
Attackability 1/5
A construction-plus-proof problem with no finite counterexample witness; resolved by proof.
- finite witness
- 0/5
- oracle cost
- 1/5
- freshness
- 3/5
- seedability
- 1/5
Reported resolution
proof by Prabhanjan Ananth and Amit Sahai, with GPT-5.6 Sol Ultra (construction and main proof ideas via Codex, UCLA Moonshot Harness) on .
Construction and main ideas generated by the model; human authors refined, verified, and take full responsibility per the paper's AI-usage statement. Primary evidence attached. for the paper itself.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.