ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥3m\geq 3 and let X1,…,XmX_1,\ldots,X_m be the inputs of an mm-party computation, with ρ(∅,…,∅,X1+⋯+Xm)\rho(\emptyset,\ldots,\emptyset,X_1+\cdots+X_m) denoting the relevant randomness measure when only the last party receives the summation. The real summation function conjecture.

ρ(∅,…,∅,X1+⋯+Xm)=log⁡2(m).\rho(\emptyset,\ldots,\emptyset,X_1+\cdots+X_m)=\log_2(m).

The preceding achievability argument gives the upper bound ρ(∅,…,∅,X1+⋯+Xm)≤log⁡2(m)\rho(\emptyset,\ldots,\emptyset,X_1+\cdots+X_m)\leq\log_2(m) using a uniformly random value in {0,1,…,m−1}\{0,1,\ldots,m-1\}. The equality, and hence the matching lower bound, is the claimed unresolved part.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.