Divergence of the completability threshold

Prove or disprove that, for every fixed dimension d, NC_d(n) tends to infinity as n tends to infinity.

Background

The authors note that the only known lower bound for NC_d(n) is the trivial bound NC_d(n) > 2. They ask whether any fixed dimension necessarily requires increasingly thick hypercuboids before noncompletability can occur.