Add root aliasing for reduced depth searching

[Karanstr]

When in a block, store the trail of nodes which leads to that block. Then, when crossing boundaries start at the first shared parent when searching. This will allow for far smaller numbers and less work.