EIP-2593 Escalating Bids and Their Relationship to EIP-1559
Summary
The document explains EIP-2593, which lets a user specify a starting bid, a starting block, a maximum bid, and a final block. The bid rises over time until the transaction is included or reaches its limit. This automates the fee bumping users might otherwise perform by resubmitting a transaction. The author frames it as an improvement to first-price auctions for users who can wait, while urgent arbitrage and liquidation transactions may still need high bids immediately.
The comparison with EIP-1559 argues that the proposals have different scopes and could complement one another: EIP-1559 aims to reduce how often users face first-price auctions, while an escalator can manage bids when those auctions occur. The article critiques the EIP’s scenario analysis, including its assumptions about congestion and auction behavior, and presents historical block utilization as evidence against some scenarios. It also weighs protocol integration against external wallet or service implementations, noting tradeoffs around repeated broadcasts, privacy, flexibility, and base-layer complexity. These are design arguments and estimates, not proof of how an implemented system would perform.
Key ideas
- EIP-2593 lets users schedule a rising transaction bid between a specified starting block and maximum block.
- The mechanism automates fee increases for users who value cost savings and can tolerate waiting.
- Time-sensitive arbitrage and liquidation transactions have little opportunity to benefit from a gradual bidding process.
- EIP-2593 and EIP-1559 address different parts of blockspace pricing and could be combined.
- Protocol-level escalators reduce repeated broadcasts but raise tradeoffs involving privacy, flexibility, and complexity.
Tags
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.