ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a non-abelian simple group, let c>0c>0 be a constant, and let k=log⁡ctk=\log^c t. The kk-party tt-tuple interleaved group product over GG is the problem of computing the interleaved product of the group elements in the tuple.

Polylogarithmic-party hardness conjecture. There is no protocol for the kk-party tt-tuple interleaved group product over GG with k=log⁡ctk=\log^c t parties and communication log⁡ct\log^c t.

This more concrete formulation appears in a false-commented-out portion of the source, so its status in the paper's active argument is unclear. The provided text does not indicate whether it has been resolved.

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.