
In a joint work with @pranaytej and @EdFelten (both from @Offchain), we study the effects of block time reduction from 2s to 200ms due to the introduction of Flashblocks, on the Base chain: arxiv.org/abs/2610.03922. We classify searcher and non-searcher addresses, and using difference-in-differences design estimate the fall of effective priority fee per gas. Interesting observation is that searching activity is not uniformly distributed across (Flash-)blocks and 30% of it is concentrated in the first (Flash-)block. Reduced priority fees can be attributed to the less available value per time unit due to shorter effective times. Beyond this, we also develop an auction theoretic framework that qualitatively explains reduced priority fees, in which searchers may bid less hoping that only their transaction makes it in the current (Flash-)block. For a more comprehensive discussion, check out research post by @pranaytej: research.arbitrum.io/t/prior…. Any feedback is welcome.









