Explore ways of avoiding storage of entire ancestry in vote-node

This will cause problems in scaling to million-block network splits for example. We should investigate some type of binary search for long runs of blocks without votes.

Perhaps we can even abstract over the concept of `Ancestry` in the vote-graph, with `Vec<H>` being one kind. We only need a few primitive operations, which might be possible to bundle into a trait.