A BadgerDAO sponsored repo of Open Source Contracts for:
- Integrating Smart Contracts with Cowswap
- Non-Custodial handling of tokens via BribesProcessors
- Calculating onChain Prices
- Executing the best onChain Swap
We understand that we cannot prove a optimal price because at any time a new source of liquidity may be available and the contract cannot adapt.
However we believe that given a set of constraints (available Dexes, handpicked), we can efficiently compute the best trade available to us
In exploring this issue we aim to:
- Find the most gas-efficient way to get the best executable price (currently 120 /150k per quote, from 1.6MLN)
- Finding the most reliable price we can, to determine if an offer is fair or unfair (Cowswap integration)
- Can we create a "trustless swap" that is provably not frontrun nor manipulated?
- How would such a "self-defending" contract act and how would it be able to defend itself, get the best quote, and be certain of it (with statistical certainty)
OnChain Integration with Cowswap, all the functions you want to:
- Verify an Order
- Retrieve the OrderUid from the orderData
- Validate an order through basic security checks (price is correct, sends to correct recipient)
- Integrated with an onChain Pricer (see below), to offer stronger execution guarantees
Anti-rug technplogy, allows a Multi-sig to rapidly process CowSwap orders, without allowing the Multi to rug
Allows tokens to be rescued without the need for governance via the ragequit function
AuraBribesProcessor-> Processor for Votium Bribes earned bybveAuraVotiumBribesProcessor-> Processor for Votium Bribes earned bybveCVX
Given a tokenIn, tokenOut and AmountIn, returns a Quote from the most popular dexes
OnChainPricingMainnet-> Fully onChain math to find best, single source swap (no fragmented swaps yet)OnChainPricingMainnetLenient-> Slippage tollerant version of the Pricer
- Curve
- UniV2
- UniV3
- Balancer
- Sushi
Covering >80% TVL on Mainnet. (Prob even more)
BREAKING CHANGE: V3 is back to view even for Balancer and UniV3 functions
Returns true if the pricer will return a non-zero quote NOTE: This is not proof of optimality
/// @dev Given tokenIn, out and amountIn, returns true if a quote will be non-zero
/// @notice Doesn't guarantee optimality, just non-zero
function isPairSupported(address tokenIn, address tokenOut, uint256 amountIn) external returns (bool)In Brownie
quote = pricer.isPairSupported(t_in, t_out, amt_in)Returns the best quote given the various Dexes, used Heuristics to save gas (V0.3 will focus on this) NOTE: While the function says optimal, this is not optimal, just best of the bunch, optimality may never be achieved fully on-chain
function findOptimalSwap(address tokenIn, address tokenOut, uint256 amountIn) external virtual returns (Quote memory)In Brownie
quote = pricer.findOptimalSwap(t_in, t_out, amt_in)Variation of Pricer with a slippage tollerance
These tests compare the PricerV3 (150k per quote) against V2 (1.6MLN per quote)
brownie test tests/heuristic_equivalency/test_heuristic_equivalency.py
TODO: Improve to just use the specific quote
brownie test tests/gas_benchmark/benchmark_pricer_gas.py --gas
TODO: Add like 200 tokens TODO: Compare against Coingecko API or smth
brownie test tests/gas_benchmark/benchmark_token_coverage.py --gas
Run V3 Pricer against V2, to confirm results are correct, but with gas savings
brownie test tests/heuristic_equivalency/test_heuristic_equivalency.py
WARNING: This list is not maintained and may be out of date or incorrect. DYOR.
bveCVX Bribes Processor: https://etherscan.io/address/0xb2bf1d48f2c2132913278672e6924efda3385de2
bveAURA Bribes Processor: https://etherscan.io/address/0x0b6198b324e12a002b60162f8a130d6aedabd04c
Pricers can be found by checking processor.pricer()