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

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24242990
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

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

Yitzchak Shmalo
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon