Archived
Extension 4. `engineering-challenge latency EXCHANGE OUT.csv` opens 16 connections to the same busy markets and writes every copy of every change; `scripts/latency/analyse.py` gives each connection's speed, whether it persists, what keeping the fastest would gain, lateness by address, and lag with the clock's offset. LATENCY.md writes up four runs: on Polymarket speed persists but is worth under a millisecond, at the median only; on Kalshi's demo keeping the fastest pair lowers p99 by 28% and 42%, the threshold agreed before the runs. So the collector now recycles a Kalshi connection whose mean lateness stays, 3 minutes running, in the slowest quarter and above twice everyone's, ahead of its hourly turn. Kalshi's rule measures each duplicate's lateness; the orchestrator judges once a minute. A duplicate's lag in Polymarket's minute line is now its "lateness". Roadmap milestone 7, roadmap/07.
16 lines
608 B
TOML
16 lines
608 B
TOML
# The analysis scripts' lint: every rule, less those that don't fit two
|
|
# standalone scripts.
|
|
line-length = 100
|
|
|
|
[lint]
|
|
select = ["ALL"]
|
|
ignore = [
|
|
"D", # docstrings: written where they say something, not on every function
|
|
"ANN", # type annotations: two scripts, no type checker run
|
|
"T201", # print: the report is printed
|
|
"PLR2004", # magic values: the tests compare hand-computed numbers
|
|
"PT009", # unittest's assertEqual: the tests use unittest, no pytest
|
|
"INP001", # no package: scripts run directly
|
|
"COM812", # trailing commas: conflicts with the formatter
|
|
]
|