In 2004, Lisa Sparks had sex with 919 men in a single day, setting the current record. Lily Phillips recently announced her intention to exceed that record
https://x.com/lilyphillip_s/status/1861893961888956787?s=46&t=mqEUzsHObBgl7scl66V10A
This market will resolve to "Yes" if Lily Phillips has sex with 920 or more men in a single day by February 28, 2025, 11:59 PM ET. Otherwise, this market will resolve to "No".
If Lily Phillips cancels the attempt, or otherwise schedules the event for a time after February 28, 2025, 11:59 PM ET, this market will resolve to "No".
This market will resolve based on the first such attempt made by Lily Phillips.
This market's resolution source is information released by Lily Phillips or her official representatives.
Update 2025-16-01 (PST) (AI summary of creator comment): Additional Clarifications:
The resolution criteria are based solely on Lily Phillips' attempt to exceed the existing record of 919 by reaching 920 or more sex partners in one day by February 28, 2025, 11:59 PM ET.
Other claims: Any attempts by others to break the record before Lily Phillips do not alter the resolution criteria for this market.
@LeeBressler what about if someone else claims to have broken the record before she tries - will she have to beat that number?
The good news is that, logistically, the problem here should be at worst an NP-hard reduction to the known optimization problem of "Tip to Tip efficiency". Hardness can sometimes be difficult to establish in this context, and even if you gain proof of NP-hardness, finishing to NP-completion is another matter. It's definitely required to be poly(nomial) by transformation and an efficient (algo)rhythm will need to be demonstrated. And if one-way functions exist (easy to take in one way but hard to go reverse) the whole hardness hierarchy collapses, making the problem of, say, finding a good post-completion PSPACE computationally indistinguishable from a good bounded error probabilistic poly time (and with quantum computers, issues of simultaneous completion). For future research I'd consider permutation group problems, evaluating the hardness of three-player games (Daskalakis and Papadimitriou (2005)), and the difficulties of parallel access to LOGSPACE.
@TheAllMemeingEye bahahahahahah I was deliriously tired and saw that Twitter post and thought it was her. But then I realized it was a different thot
@LeeBressler The AI summarization in the market description seems have missed the mark at summarizing you.
@TheAllMemeingEye great q. The question terms specify the number so will stick with that, even though that would no longer be the record… seems unlikely that she will break the old record but fall short of the new one - that would be pretty sad