Search, quotienting, and arithmetic have different exponential boundaries

Exact statement

The canonical hub quotient can have all $2^\gamma$ conflict classes, and only $\gamma+1$ pairwise-disjoint supports already give $2^{\gamma+1}$ XCC solutions. Explicit quotient materialization and solution enumeration can require exponential size. Neither construction proves that arithmetic evaluation requires $2^{\Omega(\gamma)}$ time.