Work

One bit is optimal for cosmic coin flipping on at most nine bits

Year: 2026
Type: preprint
Abstract: In the cosmic coin flipping problem of Mossel and O'Donnell, k parties receive independent ε-noisy copies of n uniform bits and each outputs a uniform bit, aiming to maximize the probability that all outputs agree. Mossel and O'Donnell asked whether, for 2 ≤ k ≤ 9, the best antisymmetric protocol is for every party to output its first bit. The cases k ≤ 5 follow from work of Witsenhausen, Mossel and O'Donnell, and Yu. We prove that the answer is positive for 6 ≤ k ≤ 9 whenever n ≤ 9. By symmetrization it suffices to compare the first-bit function with the 319,124 antisymmetric left-monotone functions on nine bits. After the substitution t = 2ε/(1-2ε) we show that, for every other function, the coefficients of degrees 1 to nk-2 of the numerator of the difference of agreement probabilities are positive, using floating-point arithmetic with a rigorous error bound. For n ≤ 8 an exact computation confirms the inequalities.
Language: English
Open Access status: green
OpenAlex ID: W7233580709
Cites:
Cited by:
Related to: