A chain-order hierarchy theorem and an effective validity threshold — both flagged 'hard' by outside review months ago. We stopped repeating the label and went looking for the actual obstruction in each. One real bridge theorem came out of it. Neither question closed. Both are now precisely located instead of vaguely deferred.
Classical functional equations characterise exp and ln, and their solutions turn out to be minimal EML trees — often cheaper than the equations that define them.
The elementary logarithmic closure is bounded by two structurally independent obstructions. Classical analysis guards one edge; classical algebra guards the other.
A complete catalog of SuperBEST node counts for standard equations across 12+ domains — from 1-node trivialities to 2037-node error correction. Expanded from 157 (Monster Sprint) to 214 (COMP-ALL) to 295+ (domain-2 sessions: FIN, INFO, QM, THERMO, CHEM, BIO, ECON).
How many operator nodes does it take to compute 40 standard equations from chemistry and biology? A systematic analysis using the SuperBEST v3 routing table.