nx_jobclaim_reap_gate.nx

nx_jobclaim_reap_gate.nx -- BITE-PROOF for the dead-claim reaper, both directions. IT DRIVES THE SHIPPING CODE. Every tooth calls nx_jobclaim_lib directly -- the same jr_state_of, jr_decide, jr_examine and jr_tombstone that nx_jobclaim_reap and nx_joblost_gate call. A tooth that tests a re-implementation proves nothing about what ships. THE ANTI-VACUITY TOOTH IS FIRST AND IT IS THE AGE AXIS. Two claims with byte-identical contents, differing ONLY in age, must decide differently. A reaper that ignored age would fire on both; a reaper that refused everything would fire on neither -- and a guard that refuses everything passes every negative test, which is why T10 carries a POSITIVE control beside its refusals. T3 IS THE TOOTH THIS WHOLE CHANGE EXISTS FOR. The tombstone is APPENDED, so a reaped claim still contains `state=CLAIMED`. T3 asserts BOTH markers are present in the same bytes AND that the shared classifier still answers REAPED. If the classifier ever tests CLAIMED before REAPED, T3 is the tooth that goes red -- and without it the reaper is a no-op that looks like a fix. FIXTURES ARE BUILT AT RUNTIME UNDER /tmp/<gate>/ and their ids are DERIVED FROM `now`, so the age axis under test is real rather than frozen. Setup unlinks every fixture path before creating it, so the gate is idempotent: a gate that is not idempotent reports on its first run and lies about every run after. license_tier: ORIGINAL expect_exit: 0