Succinct complete problems in DTIME(EXP(EXP(...)))
See, e.g., Theorem 5 of 


  Balcazar, Lozano, and Toran, The complexity of algorithmic problems on succinct instances (doi)


This theorem essentially lets you bootstrap up the tower of exponentials as desired, using the appropriate standard bounded version of the halting problem as being complete for most standard classes.