Theorem: Any protocol of date problem has success probability less than which is about . Here is the biggest number such that .
Proof: First, let's introduce some notation. is the set of permutations of .
For any two permutations and , we say if and fit with the first [...]