{"sources":[{"url":"https://raw.githubusercontent.com/gtmcknight/amm-sim/main/research/filter-brief.md","quote":"The optimum exploits the naive arbitrageur: after a displacement D of the spot from p, set the fee on that side to about D minus 7 bps."},{"url":"https://raw.githubusercontent.com/gtmcknight/amm-sim/main/research/replica.py","quote":"RNG streams differ from the Rust engine, so absolute scores move by the seed set;\ncompare policies paired on the same seeds."},{"url":"https://raw.githubusercontent.com/gtmcknight/amm-sim/main/research/oracle_table.json","quote":"\"fees\": \"askFee = 1 - exp(ln(spot/p) - ask*0.003); bidFee = 1 - exp(-bid*0.003 - ln(spot/p)); clamp to [0, 0.10]\""},{"url":"https://raw.githubusercontent.com/gtmcknight/amm-sim/main/research/setup.sh","quote":"uv venv --python 3.12 .venv;uv pip install $R/$W numpy numba cma py-solc-x==2.1.0 pyrevm==0.3.7;uv pip install --no-deps -e ."},{"url":"https://raw.githubusercontent.com/benedictbrady/amm-challenge/6b6921f8d463314aa7c96234e1be25a25245f704/amm_sim_rs/src/lib.rs","quote":"/// * `submission_bytecode` - Compiled bytecode for the submission strategy"},{"url":"https://raw.githubusercontent.com/benedictbrady/amm-challenge/6b6921f8d463314aa7c96234e1be25a25245f704/amm_competition/competition/config.py","quote":"    gbm_sigma_min=0.000882,\n    gbm_sigma_max=0.001008,"},{"url":"https://raw.githubusercontent.com/benedictbrady/amm-challenge/6b6921f8d463314aa7c96234e1be25a25245f704/amm_competition/competition/match.py","quote":"            rng = np.random.default_rng(seed=i)"}]}