diff --git a/README.md b/README.md index 32da3cb..77200d3 100644 --- a/README.md +++ b/README.md @@ -3,7 +3,7 @@ A sandwich-making machine to perform Uniswap V2/V3 sandwich attacks written using Rust and Huff. ## Brief Explanation -Anytime that a transaction interacts with a Uniswap V2/V3 pool and its forks, there is some slippage introduced (routers, aggregators, other MEV bots). Sandwich bots, like this one, are a toxic form of MEV as they profit off this slippage by frontrunning the transaction pushing the price of an asset up to the slippage limit, and then immediately selling the asset through a backrun transaction. +Anytime that a transaction interacts with a Uniswap V2/V3 pool and its forks, there is some slippage introduced (routers, aggregators, other MEV bots). Bot will profit off this slippage by frontrunning the transaction pushing the price of an asset up to the slippage limit, and then immediately selling the asset through a backrun transaction. **Bot Logic Breakdown** can be found under [bot/README.md](https://github.com/phureewat29/sandwich-maker/tree/master/bot) diff --git a/bot/README.md b/bot/README.md index dfbc74f..0a70e30 100644 --- a/bot/README.md +++ b/bot/README.md @@ -1,6 +1,6 @@ # Sandwich Maker Bot ![license](https://img.shields.io/badge/License-MIT-green.svg?label=license) -Bot logic relies heavily on REVM simulations to detect sandwichable transactions. The simulations are done by injecting a modified router contract called [`LilRouter.sol`](https://github.com/phureewat29/sandwich-maker/blob/master/contract/src/LilRouter.sol) into a new EVM instance. Once injected, a concurrent binary search is performed to find an optimal input amount that results in the highest revenue. After sandwich calculations, the bot performs a [salmonella](https://github.com/Defi-Cartel/salmonella) check. If the sandwich is salmonella free, the bot then calculates gas bribes and sends the bundle to the fb relay. +Bot logic relies heavily on REVM simulations to detect sandwichable transactions. The simulations are done by injecting a modified router contract called [`LilRouter.sol`](https://github.com/phureewat29/sandwich-maker/blob/master/contract/src/LilRouter.sol) into a new EVM instance. Once injected, a concurrent binary search is performed to find an optimal input amount that results in the highest revenue. After sandwich calculations, the bot performs a [salmonella](https://github.com/Defi-Cartel/salmonella) check. If the sandwich is salmonella free, the bot then calculates gas bribes and sends the bundle to the Flashbots relay. Performing EVM simulations in this way allows the bot to detect sandwichable opportunities against any tx that introduces slippage.