Intervening / interrupting UTXO transactions
Suppose we are interacting with auction contract.
Bob posts a transaction with bid Alice posts a transaction with lower bid, slightly before bob.
Alice consumed the original UTXO since she sent first. Bob’s transaction with original UTXO becomes invalid because Alice went first and consumed it.
Alice can keep front running Bob, making it impossible for Bob to consume UTXO.
Contracts accept malleable transactions that do not depend on UTXO of the contract. Uses ckb-vm library to implement conv.
Algorithm for miners to recognize the convention, detect what validity conditions exactly a signed transaction does or does not depend on, and automatically re-run an updated transaction with a modified contract UTXO when appropriate.
An optimization heuristic for miners to optimize their earnings based on the available pool of potential transactions.