the hundred prisoner's problem is cool

describing the optimal strategy to solve one of the variants, but more generally applicable to the solution to the main problem:

"The success of the strategy is based on building a correlation between the successes and failures of the two players."

this feels like a sort of magic because you sacrifice any chance of success the doomed worlds had to make the other worlds a guaranteed success

my intuition is that this could be exploited somehow to create a cryptosystem that would be probabilistic but the chance of failure was infinitesimally small, but i'm not smart enough to figure out how

so i'm starting to think my intuition was wrong

but i don't think it would necessarily have to make use of the permutation property thing that's unique to the 100 prisoner's problem, maybe it could more generally make use of an probabilistic operation with some redundancy

i got sidetracked and looked up a bunch of stuff and actually i think they already made it

but i don't even understand it