Existence of Bipartite Bound Information
Does bipartite bound information exist: classical correlations between two parties and an eavesdropper that cost secret bits to create, yet from which no secret key can ever be distilled?
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Construction
- Field
- Classical & quantum information theory
- Posed by
- Nicolas Gisin & Stefan Wolf
- Year posed
- 2000
- Years open
- 26y
- Solved
- 2026-07-28
- Model
- GPT-5.6 Sol
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 25 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The explicit example - a distribution on two bits and a trit with zero distillable key but positive secrecy cost - was found with GPT-5.6 Sol; the authors reconstructed the proof line by line.
Verification
Authors reconstructed the proof line by line with exact ancillary checks; public arXiv preprint, not yet peer-reviewed. The paper also shows the distributions that originally motivated the conjecture are not themselves examples.