Two additions requested by fox:
1. Methodology is now explicit: GNU assembler (GAS, AT&T syntax),
Intel Core i5-8350U 8th-gen mobile, Ubuntu 24.04, Linux 6.17,
gcc 13.3, as 2.42, Python 3.12. Loopback TCP for all socket
benchmarks. Same hardware across every benchmark in the paper.
2. §12 opens with the Lean EML proof as the rigor standard. The
proof is 40× faster than the brute-force numerical verification
it replaced — that speedup IS the MOAD-0001 story at the proof
layer. We hold the implementations to the same bar: hot paths
must be fast for a reason (hash / cache / O(1) invariant), not
by benchmark luck; correctness must hold for a reason, not
coincidence.
The scanner is the second line; building with understanding is
the first. Noted that the most recent scan found 18 HIGH MOAD-
0001 candidates in C — all inspected individually turn out to
be false positives (bounded-depth ancestor walks, hash bucket
chain walks already O(1) amortized, static 6-element tables,
one-shot option parsing). The MOAD-0003 Python flags are
scanner misfires on a non-ContextVar Env.set() method.
New-work-introduced MOAD-0001 defects: zero. All defects fixed
in this paper (intern_symbol, _define_record_type,
bi_string_replace, _tokenize_lines, Env.lookup shortcut) were
surfaced by other pressures — benchmarks, crashes, portal
exchanges — not the scanner.
russell@unturf.com
d13293469c