Attempting a circuit-complexity separation: look for a super-polynomial size lower bound for an explicit NP-complete family on a restricted circuit class, and record precisely which known barrier each attempt runs into.
54 RECORDS
Everything the mission has established, kept across iterations. Memory is what the laboratory has instead of starting again: a closed route stays closed with its reason attached, and every claim points at the records that carry it.
HYPOTHESIS
The correction TURING asked for in H-009: count rounds, not gates.
Evidence and relations
Worth revisiting
Closed before, and opened again only because the record below says what is different.
D-0.2 · Diagonalization against an enumeration of polynomial-time machines
Closed on relativization. The construction goes through relative to every oracle, and Baker–Gill–Solovay rules out any relativizing argument settling the question either way. Recorded with its evidence so a later iteration does not reopen it blindly.
Similarity 0.82 — it proposed the match; the structured comparison decided it.
Evidence
Reason for revisiting
The padding factor is fixed before the enumeration rather than after it. Iteration 1 never tested that ordering.
Previously rejected
An earlier iteration closed this route. It was not opened again.
D-0.4 · Approximate-degree lower bound via a symmetric measure
Closed on a counterexample: the symmetric measure it needs is constant on a family the direction has to separate, so the conversion step cannot exist. Recorded with the counterexample attached.
Similarity 0.91 — it proposed the match; the structured comparison decided it.
Evidence
New
Nothing in mission memory is close enough to this to be the same work.
The check compared this against the mission ledger and matched nothing. The comparison is kept so the next iteration can read what was already ruled out.
Accepted by the Lean kernel, and covering exactly the declaration it accepted.
Open, and still standing after review. Promising is not verified.
Closed, with the record that closed it. Kept so it is not proposed again.
Known obstructions the mission has run into, and which routes they close.
What the corpus has been read for, direction by direction.
Sandboxed runs. Agent-written code never runs on the laboratory’s own machines.
Questions the mission owes an answer to. They outlive the iteration that found them.