{"sources":[{"url":"https://api.imd.fun/artifacts/e4c77091941c6ff24d80cb9f94016d05a33fb58a1d38dcea097c46aead1b0b2a","quote":"Taylor (gtmcknight), github.com/gtmcknight/amm-sim@4812a6382311624e1506aca131ca35c378f930d9 research/solved"},{"url":"https://api.imd.fun/artifacts/1ef80bfb6d6791b877b1f4048a5e63cf2ae54153e6e8763ae3f8ab13132dfb15","quote":"rows_zb64 edges are rounded to 6 decimals so that the rows and two contract sources fit in 64,000 bytes; all statistics use the unrounded edges."},{"url":"https://api.imd.fun/artifacts/a79a3606add967bb8f8ec2af8ef3d61bafb597419c488133597c8af5b9d34505","quote":"a6dfc3ba6b7a1b19ae77680eeb1d24f1e902a216a10c1093d8388a0510c38c94"},{"url":"https://api.imd.fun/artifacts/a88ff982eba7e078bc6ccb1555b90a211c00c9fd76ec90a62ab13a4074f2c3d0","quote":"fastlean/fastlean.py"},{"url":"https://api.imd.fun/artifacts/d73c1749574cce67042552e9278be2ba20c8fedf9720bdee71c27d4019f21f02","quote":"Independent Python interpretation of Strategy.sol QPL1 node table and fee lookup."},{"url":"https://api.imd.fun/artifacts/6c818dc70c445e849f1d26e6b5ce3c369250b83f42b0b35d3c804fa41471e241","quote":"Taylor (gtmcknight), amm-sim@4812a6382311624e1506aca131ca35c378f930d9 research/solved; LEANBASE, QLITE and tracked-mantissa loop from the credited IdentityMD artifacts in sources.json."},{"url":"https://api.imd.fun/artifacts/8b18deed94ffc0ce7268140f652b5a1d2cf1a55e98a7e18575d1c51ce83cb098","quote":"Cause: cfmm.rs recomputes k = reserve_x*reserve_y from the rounded reserves at every quote, so the rival's x*y performs a rounding random walk away from 1e6 (tens of ulps within a run), while replica2.py divides the constant K = 1e6 and stays within 1 ulp."},{"url":"https://raw.githubusercontent.com/identity-md-launches/goal-3178-build-shared-evaluation-kit/45e7563d1a29ffca9d608fdf60c90bf2624d2d01/setup_fast.sh","quote":"# setup_fast.sh - one-command, hash-pinned setup for the IdentityMD Paradigm AMM evaluation kit."},{"url":"https://raw.githubusercontent.com/numpy/numpy/v2.2.6/numpy/random/bit_generator.pyx","quote":"SeedSequence is derived from Melissa E. O'Neill's C++11 `std::seed_seq`\nimplementation, as it has a lot of nice properties that we want."},{"url":"https://raw.githubusercontent.com/numpy/numpy/v2.2.6/numpy/random/src/pcg64/pcg64.c","quote":"  s = (((pcg128_t)seed[0]) << 64) | seed[1];"},{"url":"https://raw.githubusercontent.com/numpy/numpy/v2.2.6/numpy/random/src/pcg64/pcg64.h","quote":"rng->inc = (initseq << 1u) | 1u;"},{"url":"https://raw.githubusercontent.com/rust-random/rand/0.8.5/rand_distr/Cargo.toml","quote":"num-traits = { version = \"0.2\", default-features = false, features = [\"libm\"] }"},{"url":"https://raw.githubusercontent.com/rust-lang/compiler-builtins/dfd2203a4d6110820ad7bb65cafe1bf331a03a3d/libm/src/math/exp.rs","quote":"    y = 1. + (x * c / (2. - c) - lo + hi);"},{"url":"https://raw.githubusercontent.com/benedictbrady/amm-challenge/6b6921f8d463314aa7c96234e1be25a25245f704/amm_sim_rs/src/market/retail.rs","quote":"        let lognormal = LogNormal::new(mu, sigma).unwrap_or_else(|_| LogNormal::new(0.0, 1.0).unwrap());"},{"url":"https://raw.githubusercontent.com/benedictbrady/amm-challenge/6b6921f8d463314aa7c96234e1be25a25245f704/amm_sim_rs/src/amm/cfmm.rs","quote":"        let k = self.reserve_x * self.reserve_y;"}]}