[–] omgwtfbyobbq 1 day ago
[–] markasoftware 1 day ago
Basically when somebody makes a pricing error on a decentralized cryptocurrency exchange there's a mob of automated arbitrage bots that try to trade against it. Who wins and actually gets to make the trade is mainly determined by how high of a transaction fee your bot is willing to pay.
You can win instantly by offering to trade with a transaction fee so high it almost wipes out all but a cent or two of the entire arbitrage profits, because nobody else will pay a higher fee.
Instead what happens is bots offer the lowest possible fee, then immediately increase their fee as soon as they see a competing bot try to take the trade with a higher fee. This results in the bot offering the highest fee changing every several milliseconds as the fee quickly grows.
The way Ethereum mining works, this results in the winning bot being randomly selected from among the set of bots "bidding" up the transaction fee: blocks are mined at random intervals of iirc about 20 seconds, and whoever had the highest bid at the time the next block is mined wins. <20 seconds of bidding is short enough that even with the bidding, the transaction fee doesn't get bid up particularly high, and the winner makes out with a highly profitable arbitrage trade.
By giving up a guaranteed win and instead rolling the dice against other bots, transaction fees stay low and everyone has a higher expected profit. It's coordination that happens without any communication between the participants and quite possibly the participants didn't realize they were in effect cooperating when they added the high speed bidding behavior to their bots.
[–] JumpCrisscross 1 day ago
This is like 1980s sawtooth algos in real finance.
A lot of crypto is former HF folks taking old strategies to a dumber field.
[–] consensus1 21 hours ago
[–] 59percentmore 20 hours ago
[–] mrtesthah 17 hours ago
[–] lotsofpulp 18 hours ago
[–] JumpCrisscross 13 hours ago
[–] malfist 17 hours ago
[–] lotsofpulp 17 hours ago
[–] sandworm101 20 hours ago
[–] markasoftware 12 hours ago
For example, imagine a car auction that lasts only 20 seconds, with a random delay of up to 1 second, and with a very small minimum bid increment, say 2 cents, and no bidding fee or limit on number of bids. Now image 5 different people each outbidding each other by the minimum bid increment every 10 milliseconds. The price will climb by about $2/second, so by the end of auction, the winner will get the car for $40. Because everyone's bidding so fast, and nobody knows exactly when the auction will end, the winner is effectively random. At least on an expected value basis, this is highly beneficial to the participants vs actually bidding up to the true price of the car until other participants are not willing to bid anymore.
https://en.wikipedia.org/wiki/Tacit_collusion