Thanks for this clear explanation on discrete timeboost.
It seems that the initial idea of explicit time boost has been removed in favour of a more simple priority gas auction within a slot that is purely defined by arrival times. I assume this is mainly to reduce latency? Are there any other factors that contributed to this transition?
It seems to make the scheme susceptible to the issue drawn here
An optional approach could be to reintroduce the original time boost with a different value g* << g where g* only accounts for the time boost to reach the previous block time slot. This could bring in the additional benefit of collecting value that would be otherwise lost to latency racing for this edge case. While only marginally increasing the latency by g* (as the sequencer would have to wait for this additional g* window to elapse).