Kilominx can be solved in 34 moves

Last night, I found this thread on the speedsolving forums which proves an upper bound of 46 moves. First, the puzzle is separated into two halves, which takes at most 6 moves. Each half is then solved in at most 20 moves (= 7 moves for orientation + 13 moves for permutation, after orientation is solved), for a total of 6+2*(7+13) = 46. xyzzy writes
The ⟨U,R,F⟩ subgroup, while much smaller than G_0, is still pretty large, having 36 billion states. It's small enough that a
full breadth-first search can be done if symmetry+antisymmetry reduction is used, but I will leave this for another time.