Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

An $Ω( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures

Young Kun Ko

Abstract

We resolve the long-standing open problem of Boolean dynamic data structure hardness, proving an unconditional lower bound of $Ω((\log n / \log\log n)^2)$ for the Multiphase Problem of Patrascu [STOC 2010] (instantiated with Inner Product over $\mathbb{F}_2$). This matches the celebrated barrier for weighted problems established by Larsen [STOC 2012] and closes the gap left by the $Ω(\log^{1.5} n)$ Boolean bound of Larsen, Weinstein, and Yu [STOC 2018]. The previous barrier was methodological: all prior works relied on ``one-way'' communication games, where the inability to verify query simulations necessitated complex machinery (such as the Peak-to-Average Lemma) that hit a hard ceiling at $\log^{1.5} n$. Our key contribution is conceptual: We introduce a 2.5-round Multiphase Communication Game that augments the standard one-way model with a verification round, where Bob confirms the consistency of Alice's simulation against the actual memory. This simple, qualitative change allows us to bypass technical barriers and obtain the optimal bound directly. As a consequence, our analysis naturally extends to other hard Boolean functions, offering a general recipe for translating discrepancy lower bounds into $Ω((\log n / \log\log n)^2)$ dynamic Boolean data structure lower bounds. We also argue that this result likely represents the structural ceiling of the Chronogram framework initiated by Fredman and Saks [STOC 1989]: any $ω(\log^2 n)$ lower bound would require either fundamentally new techniques or major circuit complexity breakthroughs.

An $Ω( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures

Abstract

We resolve the long-standing open problem of Boolean dynamic data structure hardness, proving an unconditional lower bound of for the Multiphase Problem of Patrascu [STOC 2010] (instantiated with Inner Product over ). This matches the celebrated barrier for weighted problems established by Larsen [STOC 2012] and closes the gap left by the Boolean bound of Larsen, Weinstein, and Yu [STOC 2018]. The previous barrier was methodological: all prior works relied on ``one-way'' communication games, where the inability to verify query simulations necessitated complex machinery (such as the Peak-to-Average Lemma) that hit a hard ceiling at . Our key contribution is conceptual: We introduce a 2.5-round Multiphase Communication Game that augments the standard one-way model with a verification round, where Bob confirms the consistency of Alice's simulation against the actual memory. This simple, qualitative change allows us to bypass technical barriers and obtain the optimal bound directly. As a consequence, our analysis naturally extends to other hard Boolean functions, offering a general recipe for translating discrepancy lower bounds into dynamic Boolean data structure lower bounds. We also argue that this result likely represents the structural ceiling of the Chronogram framework initiated by Fredman and Saks [STOC 1989]: any lower bound would require either fundamentally new techniques or major circuit complexity breakthroughs.

Paper Structure

This paper contains 32 sections, 13 theorems, 141 equations, 3 figures.

Table of Contents

  1. Introduction
  2. Our Contribution
  3. General Lifting Theorem
  4. Applications
  5. Previous Works
  6. Explicit Quests for Poly-logarithmic Lower Bounds
  7. Chronogram Method
  8. Chronogram + Cell-sampling
  9. Previous Work on the Multiphase Problem
  10. Technical Contribution: The 2.5-Round Communication Game
  11. The Core Challenge.
  12. Our Key Insight.
  13. Verification Step
  14. Our Second Contribution: Handling 2.5-Round Protocols.
  15. The Complete Argument.
  16. ...and 17 more sections

Key Result

Theorem 1.1

For the Multiphase Problem with $f$ Inner Product over $\mathbb{F}_2$, and $m = n^{1+\Omega(1)}$,

Figures (3)

  • Figure 1: Historical progression of dynamic cell-probe lower bounds.
  • Figure 2: The Chronogram technique decomposes $n$ updates into $\ell = \Theta(\log_{\beta} n)$ epochs with geometrically growing sizes $n_i = \beta^i$. Crucially, epochs are processed in reverse order (largest first). Each epoch $i$ has associated cells $C_i$ that were last updated in that epoch. A query algorithm for $q \in \mathcal{Q}$ probes $t_q[i]$ cells from each $C_i$.
  • Figure 3: Our 2.5-round Multiphase Communication Game. The crucial difference from prior work is the verification step (Round 2): Bob checks if Alice's transcript $A_Q$ is consistent with the actual memory $U$. The 0.5-round message $\Phi (U)$ is sent independently of query $Q$, making this analyzable with information-theoretic techniques from ko_adaptive_2020ko_lower_2025.

Theorems & Definitions (42)

  • Theorem 1.1
  • Corollary 1.2
  • Definition 2.1: Entropy
  • Definition 2.3: Mutual Information
  • Definition 2.4: KL-Divergence
  • proof
  • proof
  • Definition 2.11
  • Definition 2.13: Average Min-Entropy
  • Lemma 2.14: Lemma 2.2 of dodis_fuzzy_2008
  • ...and 32 more