Stacktrie prover v3

[holiman]

This PR is my second attempt at implementing what I outline here: #24556 (comment) .
It (so far) implements half of verifying a range with stacktrie, which means initializing the stacktrie with the correct initial structure. After that, we can fill with the keys.

IT does not yet contain code to fix up the right-hand side, if one does not want to fill it with the entire remaining range. It's a PoC so far, ideas/suggestions welcome. I find the latter part a bit more difficult than the initial part, since it cannot just create a stacktrie from given data, but must actually massage the existing stacktrie to conform to the desired structure.

[holiman]

Closing this.
Note to self though. We (@fjl and I) discussed this a bit, and the problems with the stacktrie being totally separate from the current trie: using stacktries as node representations instead of node.
If the stacktrie operated on nodes, then it would be easier to switch between trie/stacktrie, and stacktrie would simply be one way to construct a trie (but unresolved as we go along).

I implemented that approach here: https://github.com/holiman/go-ethereum/tree/inctrie . However, the approach is iirc ~2x slower than the stacktrie, so I didn't continue it.