Permutation-Based Labeled Chip-Firing

Let me begin with labeled chip-firing on an infinite directed binary tree, where the root is at the top. Place 2n chips, labeled from 0 to 2n − 1, at the root. A move consists of choosing any two chips at the same vertex and firing them: the smaller chip goes to the left child, [ ]