@awemany
I re-read the Vermorel CTOR paper again this evening. I know you pointed out the problems with this section, but I couldn't resist posting these three paragraphs. It gives the impression that the transactions you admit into mempool need to be topologically sorted to create a block candidate and that this is some big problem. But the only way they can enter your mempool in the first place is in a topological order. Furthermore, the paper makes it seem like appending new transactions to your block candidate as they come in while maintaining the topological order is "an open research problem." But you can just tack the new transactions onto the end of your block. The order is already topological.

They say you can't have your cake and eat it too. This is true, but you also can't eat your cake

* before* you have it. If someone ate his cake, causality requires that he must have previously had his cake. There is no risk that the "eating" and the "having" occurred in the wrong order.

Or consider one's family tree. It is a directed acyclic graph not unlike transactions in a block. The order the people in one's family tree were born

*is* a topological order. There is no way it can be

*non-*topological because someone cannot have a child until

*after* they themselves were born. When your children have children, you don't need to worry that a child might be born in a non-topological order. If things like that were possible, we'd have bigger problems like your nephew becoming your great uncle and you becoming your own grandfather!

*"Son, make sure you practice safe sex. If you have a child in a non-topological order it could lead to a logical paradox that destroys the universe."*