Answers are grounded in this paper and cite their sources.
Theoretical analysis demonstrates the impossibility of always-correct succinct dynamic fusion nodes in packed-memory models, indicating strict limits on data structure performance.
This record contains the paper and reproducibility package for a cell-probe lower bound that rules out always-correct succinct constant-time dynamic fusion nodes in the fixed-layout packed-memory model. The package includes the full Lean 4 formalization for deterministic and fresh-random Las Vegas execution, a theorem-to-declaration map, an axiom audit, deterministic manifests, and manuscript build inputs.
No takes yet. Share an insight, caveat, or question.
Ian D'Ambrosio (2026) studied this question.