Ethereum Research's latest study suggests that in the context of frame transactions and account abstraction, the key distinction for transaction admission rules isn't about 'how much state is read,' but rather whether the verification logic depends on the transaction order within a block. The article categorizes this into three types: single-writer states, shared states that accept old state roots, and competitive states that must read real-time values. It argues that many existing mechanisms essentially set different thresholds based on this dimension. The author further points out that 'exactly-once' assertions—such as whether a nullifier has been used or whether a slot is still free—naturally require total order coordination and cannot completely eliminate sequential dependency through proof-based admission alone. https://(wublock123.com)/news/ethereum-mempool-admission-priority-sequential-dependency-not-state-reads-67964